期刊文献+

社交网Twitter平台的人物关系网社区发现 被引量:7

Finding Community Structures of Users' Relationships in Twitter
下载PDF
导出
摘要 社交网络服务(social networking service,SNS)已融入到大众生活中。人们将自己的信息上传到网络中,并通过社交网站管理自己的社交圈子,由此造成大量的个人信息在社交网络上被公开。文章基于Twitter平台,设计实现了Twitter用户关系网的社区发现。通过实时采集Twitter用户信息,重建人物关系网,改进Newman快速算法划分社区发现人物关系网。文章通过可视化的界面呈现用户的社区关系,提供用户网络行为,为决策者的舆情监控或个性推荐提供了参考凭据。 SNS (social networking service) has been integrated into public life. People upload their own information to the network and use the social networking sites to manage their social relationship. A large number of personal information is presented on social networks. Based on the Twitter platform, this paper designs to find community structure of Twitter users. With the real-time information collecting, this paper rebuilds the relationships of users, improving Fast- Newman algorithms in dividing social networks. The paper uses a visualization system to automatically visualizing community structures, providing decision makers with user network behavior to implement personalized recommendation.
作者 钟玲 林柏钢
出处 《信息网络安全》 2014年第5期32-36,共5页 Netinfo Security
基金 福建省科技厅重点资助项目[2012H0025] 福建省安全课题资助项目[822711]
关键词 TWITTER 社交网络 社区发现 Newman快速算法 Twitter social networking community mining Fast-Newman algorithm
  • 相关文献

参考文献11

  • 1Jiawei Han,Micheline Kamber.数据挖掘概念与技术[M].北京:机械工业出版社,2008:148-154. 被引量:13
  • 2Travers, S. Milgram. An experimental study of the small world problem[J]. Sociometry, 1969, 32(4):425-443. 被引量:1
  • 3Dunbar, R.I.M. Neocortex size as a constraint on group size in primates[J]. Journal of Human Evolution, 1992, (20): 469-493. 被引量:1
  • 4M. E. J. Newman, M. Girvan. Finding and evaluating community structure in net-works[J].Phys.IKev.E,2004,69(2):026113. 被引量:1
  • 5M. Girvan, M. E. J.Newman. Communitys tructure in social and biological networks[J]. PNAS, 2002,(99):7821-7826. 被引量:1
  • 6Aaron Clauset, M.E.J.Newman, Cristopher Moore. Finding community structure in very large networks[J]. Phys IKevE, 20(14, 70(6):066111. 被引量:1
  • 7Lee, Audrey, Streinu, Ileana. Pebble game algorithms and sparse graphs[J]. Discrete Mathematics, 2008, 308 (8): 1425-1437. 被引量:1
  • 8Newman M E J. Fast algorithm for detecting community structure in networks[J].Phys Rev E, 2004, 69(2):26-113. 被引量:1
  • 9Zhou Wei, Guillaume Pierre, Chi-Hung Chi. CloudTPS: Scalable Transactions for Web Applications in the Cloud[J]. Services Computing, IEEE Transactions on, 2012, 5(4):525 - 539. 被引量:1
  • 10段晓东,王存睿,刘向东,林延平.基于粒子群算法的Web社区发现[J].计算机科学,2008,35(3):18-21. 被引量:18

二级参考文献16

  • 1杨楠,弓丹志,李忺,孟小峰.Web社区发现技术综述[J].计算机研究与发展,2005,42(3):439-447. 被引量:35
  • 2GareyMR, Johnson DS. Computers and Intractability:AGuide to the Theory of NP-Completeness. San Franeisco: W H Freeman, 1979 被引量:1
  • 3Wu F, Huberman B A. Finding communities in linear time: A physics approach[J]. Euro Phys J B, 2003,38: 331-338 被引量:1
  • 4Radicchi F, Castellano C, Cecconi F, et al. Defining and identifying communities in networks, cond-mat/0309488. 2004 被引量:1
  • 5Kemighan B W, Lin S. An efficient heuristic procedure for partitioning graphs [J]. Bell System Technical Journal, 1970,49:291-307 被引量:1
  • 6Girvan M, Newman M E J. Community structure in social and biological networks [J]. In: Proc Natl Acad,2002, 99: 7821-7826 被引量:1
  • 7Newman M E J, Girvan M. Finding and evaluating community structure in networks [J]. Physical Review E, 2004,69:026113 被引量:1
  • 8Radicchi F, Castellano C, Cecconi F, et al. Defining and identifying communities in networks, eond-mat/0309488. 2004 被引量:1
  • 9Duch J, Arenas A. Community detection in complex networks using extremal optimization. Phys Rev E 72,2005:027104 被引量:1
  • 10Kennedy J, Eberhart R C, Particle swarm optimization[C]. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, vol 4, IEEE Press,1942-1948 被引量:1

共引文献29

同被引文献59

  • 1韩哲.网络犯罪的本质特征及其刑事管辖[J].山东警察学院学报,2002,14(3):68-71. 被引量:13
  • 2孙世峰.基于非集计与弹性联合模型的交通需求分析[J].公路交通技术,2007,23(5):113-116. 被引量:4
  • 3中国互联网络信息中心.CNNIC发布第31次《中国互联网络发展状况统计报告》[EB/OL].(2013-01-15)[2013-03-04].http://www.cnnic.net.cn/gywm/xwzx/rdxw/rdxx/201302/t20130222-.38842.htm. 被引量:4
  • 4Boccaletti S, Latora V, Moreno Y, et al. Complex net- works : Structure and dynamics [ J ]. Physics Reports, 2006,424 (4/5) : 175-308. 被引量:1
  • 5Porter M A, Onnela J, Mucha P J. Communities in net- works[ J]. Notices of the AMS, 2009,56 ( 9 ) : 1082 - 1097. 被引量:1
  • 6Lancichietti A, Radicchi F, Ramasco J J, et al. Finding statistically significant communities in networks [ J ]. PloS one,2011,6(4) :1-18. 被引量:1
  • 7Karypis G, Kumar V. Multilevel k- way hypergraph partitioning [ J ]. VLSI Design, 2000, 11 ( 3 ) : 285 -300. 被引量:1
  • 8Hendrickson B, Leland R. A Multi-level algorithm for partitioning graphs [ C ] // Proceedings of the 1995 ACM/IEEE Conference on Supereomputing. ACM, 1995:28. 被引量:1
  • 9Kernighan B W,Lin S. An efficient heuristic procedure for partitioning graphs [ J ]. Bell Labs Technical Journal, 1970,49 (2) :291-307. 被引量:1
  • 10Fiduccia C M,Mattheyses R M. A linear-time heuristic for improving network partitions [ C ]//19th Conference on Design Automation. Las Vegas : IEEE, 1982: 175-181. 被引量:1

引证文献7

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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