Efficient Discovery of Top-k Closeness Centrality Key Nodes in Information Network

摘要：

　　Computing Closeness Centrality is a common method to discover key nodes in social network analysis.It is expensive in terms of time and space in traditional discovery of Closeness Centrality key nodes as it involves closeness centrality of all nodes.Experience shows us that active nodes are probably latent network center.Based on this experience, we proposed an algorithm of efficient discovery of Top-k closeness centrality key nodes in information network.Experiments show that the new proposed algorithm can guarantee accuracy and real-time response on both artificial and real-world data sets.

关键词： information network social work asynchronous roll-up Closeness Centrality Additional Window

作者: Zhi Zuo Shiping Yang

作者单位: College of Computer Science and Information, Guizhou University,Guiyang, China College of Mingde, Guizhou University, Guiyang, China

会议类型: 国际会议

会议名称: International Workshop on Data-Intensive Scientific Discovery and Applications 2013(2013数据密集型的科学发现与应用国际研讨会)

会议地点: 上海

会议语种:英文

页码: 93-100

在线出版日期: 2013-08-01（万方平台首次上网日期，不代表论文的发表时间）