虚拟社交网络中节点重要度分析

上海交通大学学报（自然版） ›› 2013, Vol. 47 ›› Issue (07): 1055-1059.

• 自动化技术、计算机技术 • 上一篇下一篇

虚拟社交网络中节点重要度分析

王昊翔，曾珊，刘挥扬

(华南理工大学计算机科学与工程学院，广州 510006；广东省计算机网络重点实验室，广州 510641)

收稿日期:2012-07-02 出版日期:2013-07-30 发布日期:2013-07-30
基金资助:
国家重点基础研究发展规划（973）项目(2009CB320505)，广东省产学研项目(2010B091000010)，中央高校基本科研业务经费(x2jsD2111270)

An Importance Analytical Approach for Online Social Network

WANG Haoxiang,ZENG Shan,LIU Huiyang

(School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006 China; Communication and Computer Network Laboratory of Guangdong Province, Guangzhou 510641, China)

Received:2012-07-02 Online:2013-07-30 Published:2013-07-30

摘要/Abstract

摘要：

根据虚拟社交网络本身的特性，提出了采用重要度矩阵迭代方法定量分析网络中各节点的重要度.该方法考虑了虚拟社交网络中各节点重要度的相互影响，以及这种影响的传递性.实验结果表明，该方法能有效分析虚拟社交网络中节点重要度，有助于提高社交网络中信息传播分析、舆情分析等工作的效率和准确性.

关键词: 复杂网络, 重要度分析, 矩阵迭代, PageRank算法

Abstract:

An importance matrix iteration algorithm for online social network importance analysis was proposed based on existing importance analysis algorithms for complex networks, and considering the characteristics of online social networks. This novel approach considers the influence between nodes and has been approved to be efficient and accurate by experiments described in the paper. This paper can help to improve the efficiency and accuracy of the analysis of information propagation and public opinions on the Internet.

Key words: complex networks, importance analysis, matrix iteration, PageRank algorithm

中图分类号:

王昊翔，曾珊，刘挥扬. 虚拟社交网络中节点重要度分析[J]. 上海交通大学学报（自然版）, 2013, 47(07): 1055-1059.

WANG Haoxiang,ZENG Shan,LIU Huiyang. An Importance Analytical Approach for Online Social Network[J]. Journal of Shanghai Jiaotong University, 2013, 47(07): 1055-1059.

参考文献

［1］Watts D, Strogatz S. Collective dynamics of small world networks［J］. Nature, 1998, 393: 440442.

［2］Barabási A, Bonabeau E. Scale free networks ［J］. Scientific American, 2003, 288: 6069.

［3］胡海波, 王科, 徐玲, 等. 基于复杂网络理论的在线社会网络分析［J］. 复杂系统与复杂性科学, 2008, 5(2): 114.

HU Haibo, WANG Ke, XU Ling, et al. Analysis of Online Social Networks Based on Complex Network Theory［J］. Complex Systems and Complexity Science, 2008, 5(2): 114.

［4］余高辉, 杨建梅, 曾敏刚. QQ群好友关系的复杂网络研究［J］. 华南理工大学学报, 2011, 13(4): 2023.

YU Gaohui, YANG Jianmei, ZENG Mingang. Research on QQ Group Based on Complex Networks［J］. Journal of South China University of Technology, 2011, 13(4): 2023.

［5］Callaway D, Newman J, Strogatz S, Watts D. Network robustness and fragility: percolation on random graphs［J］. Physical Review Letters, 2000, 85(25): 54685471.

［6］Xia Y, Fan J. Efficient attack strategy to communication networks with partial degree information［C］//Proceedings of 2011 IEEE International Symposium of Circuits and Systems. Rio de Janeiro, Brazil: IEEE Press, 2011: 15881591.

［7］Freeman L C. A set of measures of centrality based upon betweenness［J］. Sociometry, 1977, 40(1): 3541.

［8］Wagner C, Roessner J, Bobb K, et al. Approaches to understanding and measuring interdisciplinary scientific research (IDR): A review of the literature［J］. Journal of Informatics, 2011, 5(1): 1426.

［9］Opsahl, T, Agneessens, F, Skvoretz, J . Node centrality in weighted networks: Generalizing degree and shortest paths［J］. Social Networks, 2010, 32: 245251.

［10］Lerman K, Ghosh R, Kang J, Centrality Metric for Dynamic Networks ［C］//Proceedings of KDD workshop on Mining and Learning with Graphs (MLG). Washington D C, USA: ACM Press, 2010: 7077.

［11］Kim H, Tang J, Aderson R, et al. Centrality prediction in dynamic human contact networks［J］. Computer Networks, 2012, 56(3): 983996.

［12］Okamoto K, Chen W, Li X. Ranking of closeness centrality for largescale social networks ［J］. Lecture Notes in Computer Science, 2008, 5059: 186195.

［13］Lamberti F, Sanna A, Demartini C. A relationbased page rank algorithm for semantic web search engines［J］. IEEE Transactions on Knowledge and Data Engineering, 2009, 21(1): 123136.

［14］Jing Y, Shumeet B. Page rank for product image search ［C］//Proceedings of the 17th International Conference on World Wide Web 2008. Beijing China: ACM Press, 2008: 307315.

［15］Mikalai K, Maurizio M. Focused page rank in scientific papers ranking［J］. Lecture Notes in Computer Science, 2008, 5362: 144153.

［16］Liu Y, Lin Y. Supervised HITS algorithm for MEDLINE citation ranking［C］//Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering. Boston, USA: IEEE Press, 2007: 13231327.

［17］Asano Y, Tezuka Y, Nishizeki T. Improvements of HITS algorithms for spam links［J］. Lecture Notes in Computer Science. 2007, 4505: 479490.

［18］马瑞新, 邓贵仕, 王晓. 基于扩散理论的HITS算法在Web挖掘中的研究与优化［J］. 计算机应用研究, 2012, 29(1): 145147.

MA Ruixin, DENG Guishi, WANG Xiao. Research and optimization of HITS based on theory of diffusion in Web mining［J］. Application Research of Computers, 2012, 29(1): 145147.

［19］赫南, 李德毅, 淦文燕, 等. 复杂网络中重要性节点发掘综述［J］. 计算机科学, 2007, 32(12): 16.

HE Nan, LI Deyi, GAN Wenyan, et al. Mining Vital Nodes in Complex Networks［J］. Computer Science, 2007, 32(12): 16.

［20］Traud L, Kelsic D, Mucha P, et al. Comparing Community Structure to Characteristics in Online Collegiate Social Networks［J］. Technology, 2008, 53(17):117.

[1]	谢逢洁. 复杂网络上博弈行为演化的合作激励[J]. 上海交通大学学报（自然版）, 2015, 49(08): 1256-1262.
[2]	郑茂，王超，黄胜. 舰载机出动回收网络鲁棒性分析[J]. 上海交通大学学报（自然版）, 2013, 47(12): 1934-1939.
[3]	杨波, 陈影. 抽样对复杂网络生长机制的影响 [J]. 上海交通大学学报（自然版）, 2013, 47(03): 479-483.
[4]	全睿，全书海,黄亮，陈启宏. 基于模糊故障树的燃料电池发动机氢安全[J]. 上海交通大学学报（自然版）, 2010, 44(07): 951-0956.
[5]	周炎，刘亚冰，汪小帆. 一种基于层次化社团结构的复杂网络可视化平台[J]. 上海交通大学学报（自然版）, 2010, 44(03): 332-0335.
[6]	闫妍，刘晓，庄新田. 基于复杂网络理论的供应链级联效应检测方法[J]. 上海交通大学学报（自然版）, 2010, 44(03): 0-0325.

虚拟社交网络中节点重要度分析

An Importance Analytical Approach for Online Social Network

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

本文评价