$$k^{-}$$ k - -anonymization of multiple shortest paths-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

$$k^{-}$$ k - -anonymization of multiple shortest paths

Published:2016-02-18 Issue:15 Volume:21 Page:4215-4226
ISSN:1432-7643
Container-title:Soft Computing
language:en
Short-container-title:Soft Comput

Author:

Wang Shyue-Liang,Tsai Yu-Chuan,Hong Tzung-Pei,Kao Hung-Yu

Funder

National Science Council, Taiwan

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Theoretical Computer Science,Software

Link

http://link.springer.com/article/10.1007/s00500-016-2032-2/fulltext.html

Reference31 articles.

1. Backstrom L, Huttenlocher DP, Kleinberg JM, Lan X (2006) Group formation in large social networks: membership, growth, and evolution. In: Proceedings of KDD, pp 44–54

2. Backstrom L, Dwork C, Kleinberg JM (2007) Wherefore art thou r3579x?: anonymized social networks, hidden patterns. and structural steganography. In: Proceedings of world wide web, pp 181–190

3. Bhagat S, Cormode G, Krishnamurthy B, Srivastava D (2009) Class-based graph anonymization for social network data. In: Proceedings of very large data bases, pp 766–777

4. Banisar D (2006) Freedom of information around the world 2006—a global survey of access to government information laws. Available at http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1707336 . Accessed 20 Sept 2006

5. Cheng J, Fu A, Liu J (2010) K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of ACM SIGMOD conference, pp 459–470

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal privacy control for transport network data sharing;Transportation Research Part C: Emerging Technologies;2020-04

2. Correlation constraint shortest path over large multi-relation graphs;Proceedings of the VLDB Endowment;2019-01

3. Optimal privacy control for transport network data sharing;Transportation Research Procedia;2019

4. Special issue on intelligent analytics and management of mobile data and social media;Soft Computing;2017-07-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3