An Importance Analytical Approach for Online Social Network

Abstract

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

CLC Number:

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.

References

［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]	ZHANG Honga* (张红), HU Changzhenb (胡昌振), WANG Xiaojuna (王小军). Brittleness Analysis and Important Nodes Discovery in Large Time-Evolving Complex Networks [J]. Journal of shanghai Jiaotong University (Science), 2017, 22(1): 50-054.
[2]	XIE Fengjie. Incentive Mechanism for Cooperation in Evolution of Game Behaviors on Complex Networks [J]. Journal of Shanghai Jiaotong University, 2015, 49(08): 1256-1262.
[3]	ZHENG Mao,WANG Chao,HUANG Sheng. Robustness of Carrier-Based Aircraft Sortie Network [J]. Journal of Shanghai Jiaotong University, 2013, 47(12): 1934-1939.
[4]	YANG Bo, CHEN Ying. Effect of Sampling on Growth Mechanisms of Complex Networks [J]. Journal of Shanghai Jiaotong University, 2013, 47(03): 479-483.
[5]	QUAN Rui^a,QUAN Shuhai ^a,b,HUANG Liang ^b,CHEN Qihong ^b. Study on Hydrogen Safety of Fuel Cell Engine Based on Fuzzy Fault Tree [J]. Journal of Shanghai Jiaotong University, 2010, 44(07): 951-0956.