QQ客服 官方微博 反馈留言

	Sensitive edges protection in social networks
	Yu, Liangwen ; Yang, Tao ; Wu, Zhengang ; Zhu, Jiawei ; Hu, Jianbin ; Chen, Zhong
	2013
英文摘要	With the increasing popularity of online social networks, such as twitter and weibo, privacy preserving publishing of social network data has raised serious concerns. In this paper, we focus on the problem of preserving the sensitive edges in social network data. We call a graph is k-sensitive anonymous if the probability of an attacker can re-identify a sensitive node or a sensitive edge is at most. To achieve this objective, we devise two efficient heuristic algorithms to respectively group sensitive nodes and create non-sensitive edges. Finally, we verify the effectiveness of the algorithm through experiments. ? 2013 Springer-Verlag Berlin Heidelberg.; EI; 0
语种	英语
DOI标识	10.1007/978-3-642-38562-9-57
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/411802]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Yu, Liangwen,Yang, Tao,Wu, Zhengang,et al. Sensitive edges protection in social networks. 2013-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。