期刊文献+

地点网络中的社区发现

Community Discovery in Location Network
下载PDF
导出
摘要 地点网络可从一些独特的视角来刻画城市的空间结构。通过研究城市地点网络的特点及其与传统社交网络的区别,提出了基于地点网络的社区发现算法。该算法综合考虑地点临近性、地点间的连接和用户出行行为的相似性,先进行初始社区的划分,再反复迭代计算各地点隶属于本社区的程度,对隶属度较低的地点进行调整直到收敛,从而发现有意义的城市社区。通过分析社区内部地点的属性和关联,验证了算法的有效性。 The location network can portray the spatial structure of city from some unique perspectives.By studying the characteristics of urban location network and its difference with traditional social network,a community discovery algorithm based on location network was proposed.The algorithm takes into account the proximity of location,the connection between the locations and the similarity of user's travel behavior.Firstly,the initial community is divided.Then,the extent of each site belonging to this community is interatively calculated the places with lower membership degree are adjusted until convergence,so as to find significant urban communities.The validity of the algorithm was verified by analyzing the attributes and correlations of the internal sites.
作者 郑香平 於志勇 温广槟 ZHENG Xiang-ping;YU Zhi-yong;WEN Guang-bin(College of Mathematics and Computer Science,Fuzhou Universit;Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing,Fuzhou Universit)
出处 《计算机科学》 CSCD 北大核心 2018年第6期46-50,共5页 Computer Science
基金 国家自然科学基金(61300103)资助
关键词 群智感知 社区发现 地点网络 Crowd sensing Community discovery Location network
  • 相关文献

参考文献8

二级参考文献63

  • 1赵卓翔,王轶彤,田家堂,周泽学.社会网络中基于标签传播的社区发现新算法[J].计算机研究与发展,2011,48(S3):8-15. 被引量:37
  • 2Girvan M and Newman M E J. Coinmunity structure in social and biological networks[J]. Proceedings of the National Academy of Science, 2002, 9(12): 7821-7826.
  • 3Yang B, Cheung W K, and Liu 3 M. Community mining from signed social networks[J]. IEEE Transactions on Knowledge and Data Ertgmeevin9, 2007, 19(10): 1333 1348.
  • 4Newman M E J. Fast algorithm for detecting community structure in networks[J]. Physical Review E, 2004, 69(6): 066133.
  • 5Blondel V D, Guillaume J L, Lambiotte R, et al.. Fast unfolding of communities in large networks[J]. Journal of Statistical Mechanics: Theory and Ezperiment, 2008, COI: 10.1088/1742-5468/2008/10/910008.
  • 6Newman M E J. A measure of betweenness centrality based on random walks[J]. Social Networks, 2005, 27(1): 39-54.
  • 7Cai Bing-jing, Wang Hai-ying, Zheng Hui-ru, et al.. An improved random walk based clustering algorithm for community detection in complex networks[C]. 2011 IEEE International Conference, on Systems, Man,and Cybernetics, Alaska, USA, Oct. 2011: 2162-2167.
  • 8Rosvall M and Bergstrom complex networks reveal C T. Maps of random walks on community structure[J]. PNAS,2008, 105(4): 1118 1123.
  • 9Alahakoon T, Tripathi R, Kourtellis N, ct al.. K-path centrality: a new centrality measure in social networks[C]. Proceedings of 4th Workshop on Social Network Systems, Salzburg, Austria, 2011:1 6.
  • 10Ferrara E. Community structure discovery in Facebook[J] International Journal of Social Network Mining, 2012, l(l) 67 90.

共引文献85

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部