.png){kind=icon}
返回
Optimal privacy control for transport network data sharing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2019.07.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the era of smart cities, Internet of Things, and Mobility-as-a-Service, private operators need to share data with public agencies to support data exchanges for living lab ecosystems more than ever before. However, it is still problematic for private operators to share data with the public due to risks to competitive advantages. A privacy control algorithm is proposed to overcome this key obstacle for private operators sharing complex network-oriented data objects. The algorithm is based on information-theoretic k-anonymity and, using tour data as an example, where an operator's data is used in conjunction with performance measure accuracy controls to synthesize a set of alternative tours with diffused probabilities for sampling during a query. The algorithm is proven to converge sublinearly toward a constrained maximum entropy under certain asymptotic conditions with measurable gap. Computational experiments verify the applicability to multi-vehicle fleet tour data; they confirm that reverse engineered parameters from the diffused data result in controllable sampling error; and tests conducted on a set of realistic routing records from travel data in Long Island, NY, demonstrate the use of the methodology from both the adversary and user perspectives.
Keyword:
Privacy
k-Anonymity
Open data
Tour generation
Entropy maximization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.9
论文数:
4.9K
被引数:
3.2W
机构
引用论文
.png){kind=icon}
分享收藏Modeling and Simulation of Main Control Valve Mechanism of LNG Ship Steam TurbineLNG船舶汽轮机主控阀机构建模与仿真
OAAI
OAAI分享收藏Introduction: What Professor Garfield Wrought and What Management Scholars Are Attempting to Reclaim
PREAI
分享收藏
查看更多内容