期刊文献+

微博用户模型复杂网络中多维有向社区发现 被引量:1

MULTI-DIMENSIONAL DIRECTED COMMUNITY DETECTION IN COMPLEX NETWORK OF MICROBLOGGING USER MODEL
下载PDF
导出
摘要 大多数社区发现是基于一种信息的,即从一个维度来划分社区。但在现实场景中,用户之间社区构成是受兴趣、社交关系、地域、教育背景等诸多因素共同影响形成的。这些多维信息有些是无向的,如兴趣相似度等;有些是有向的,如关注关系等。根据有向社区发现的原理,将多个维度的信息融合,提出一种面向多维复杂网络的有向社区发现(MDCD)算法。通过实验证明,MDCD算法相对于传统的多维社区发现方法 AMM算法,社区发现结果准确率提高了17.7%、F-measure值提高了0.068;与一维的兴趣相似度网络进行对比,MDCD算法的三维复杂网络社区发现结果的准确率提高了36.1%、召回率提高了25.3%。由于多维有向社区发现综合考虑了多维的信息,得到的社区结构具有更重要的社会意义。 Most of community detections are based on one kind of information,i. e. to partition the community using one dimension. However in reality scene,the composition of communities between users is formed by the combined effect of many factors,such as interests,social relationships,geography,educational background,etc. Moreover,some of these multi-dimensional information are undirected,for ex.,the similarity of interests,but some others,like the relationship of follow,are directed. Based on the principle of directed community detection,in this paper we fuse the multi-dimensional information and propose a multi-dimensional complex network-oriented directed community detection algorithm( MDCD). It is proved through experiment that the MDCD algorithm,relative to conventional multi-dimensional community discovery algorithm AMM,improves the accuracy of community detection result by 17. 7% and the F-measure value by 0. 068; Furthermore,by comparing the MDCD algorithm with the one-dimensional interests similarity network,it improves the precision rate of three-dimensional complex network detection result by 36. 1% and the recall rate by 25. 3%. Since the multi-dimensional directed community detection considers the multi-dimensional information comprehensively,the community structure obtained has more important social significance.
出处 《计算机应用与软件》 CSCD 2016年第7期129-133,共5页 Computer Applications and Software
基金 国家自然科学基金项目(61303096) 上海市自然科学基金项目(13ZR1454600)
关键词 用户模型 复杂网络 多维有向社区发现 User model Complex networks Multi-dimensional directed community detection
  • 相关文献

参考文献2

二级参考文献37

  • 1Zhang Tian,Ramakrishnan R,Livny M.Birch:A New Data Clustering Algorithm and Its Applications.Data Mining and Knowledge Discovery,1997,1(2):141-182.
  • 2MacQueen J.Some Methods for Classification and Analysis of Multivariate Observations//Proc of the 5th Berkeley Symposium on Mathematical Statistics and Probability.Berkeley,USA,1967,Ⅰ:281-297.
  • 3Ester M,Riegel H P,Sander J,et al.A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise//Proc of the 2nd International Conference on Knowledge Discovery and Data Mining.Portland,USA,1996:291-316.
  • 4Ding C,He Xiaofei.k-Nearest-Neighbor Consistency in Data Clustering:Incorporating Local Information into Global Optimization//Proc of the ACM Symposium on Applied Computing.Nicosia,Cy-prus,2004:584-589.
  • 5Fr(a)nti P,Virmajoki O,Hautam(a)ki V.Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph.IEEE Trans on Pattern Analysis and Machine Intelligence,2006,28(11):1875-1881.
  • 6Zhu Qiaoming,Li Jnnhui,Zhou Guedong,et al.A Novel Hierarchical Document Clustering Algorithm Based on a kNN Connection Graph//Proc of the 21st International Conference on the Computer Processing of Oriental Languages.Singapore,Singapore,2006:120-130.
  • 7Teng S H,Yao F F.k-Nearest-Neighbor Clustering and Percolation Theory.Algorithmica,2007,49(3):192-211.
  • 8刘大有,刘杰,金弟.基于k最近邻划分的聚类算法研究//中国人工智能进展2007.哈尔滨,2007:169-174.
  • 9Luxburg U V.A Tutorial on Spectral Clustering.Statistics and Computing,2007,17(4):395-416.
  • 10Newman M E,Girvan M.Finding and Evaluating Community Structure in Networks[EB/OL].[2004-02-26].http://www.neibi.org/gateway/paf/newman%20community%20struct%20networks %20phys%20rev.pdf.

共引文献238

同被引文献6

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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