location: Current position: Home >> Scientific Research >> Paper Publications

An Algorithm with User Ranking for Measuring and Discovering Important Nodes in Social Networks

Hits:

Indexed by:会议论文

Date of Publication:2014-10-14

Included Journals:EI、CPCI-S、Scopus

Page Number:945-949

Abstract:Social networks sites pervade the WWW and have millions of users worldwide. This provides ample resources to measure the importance of nodes and discover the important nodes in social networks. Effective measures for discovering important nodes are challenging for current large-scale social networks. This paper proposes a comprehensive measure model (CMM) for node importance by combing a designed user ranking factor with the multiple properties of nodes. The proposed model leverages local regional and global impacts of nodes in social networks. More specially, the properties of nodes including degree centrality, intimacy and criticality reflect the local impact of nodes, and user ranking factor describes the global impact. Further, an important nodes discovery algorithm is proposed based on CMM and Dijkstra's algorithm. The algorithms for measuring and discovering important nodes have been implemented and applied to a citation dataset where they give promising results.

Pre One:基于交叉路口道路时空网格的车辆碰撞预警方法研究

Next One:A Hierarchical Particle Swarm Optimizer With Random Social Cognition For Large Scale Global Optimization