Location-and Relation-Based Clustering on Privacy-Preserving Social Networks

• 来源期刊: 清华大学学报自然科学版（英文版）
• 年，卷（期）: 2018,（4）
• 页码范围: 453-462
• 页数: 10页
• 语种: 英文
• DOI: 10.26599/TST.2018.9010017

摘要

Graph clustering has a long-standing problem in that it is difficult to identify all the groups of vertices that are cohesively connected along their internal edges but only sparsely connected along their external edges.Apart from structural information in social networks,the quality of the location-information clustering has been improved by identifying clusters in the graph that are closely connected and spatially compact.However,in real-world scenarios,the location information of some users may be unavailable for privacy reasons,which renders existing solutions ineffective.In this paper,we investigate the clustering problem of privacy-preserving social networks,and propose an algorithm that uses a prediction-and-clustering approach.First,the location of each invisible user is predicted with a probability distribution.Then,each user is iteratively assigned to different clusters.The experimental results verify the effectiveness and efficiency of our method,and our proposed algorithm exhibits high scalability on large social networks.