ProfitLeader: identifying leaders in networks with profit capacity
- 164 Downloads
Identifying ‘Leaders’ in a network is a significant step to optimize the use of available resources, accelerate or hinder spreading information. In this paper, we propose a new measure to characterize the importance of a node, called ProfitLeader, which considers the problem of critical node identification from a novel perspective: profit capacity. Unlike established approaches to identify influential nodes in networks based on its local topology or information diffusion capacity, ProfitLeader, ranks the influence of each individual node via its profit capacity. The basic idea is to view each node as a person, and measure how much profit “the person” can offer for others. Namely, the more profit “the person” provides for others, the more important the node is. To characterize the profit capacity of each node, its available resource and sharing probability to its neighbors are investigated. Building upon the profit capacity, ProfitLeader has several remarkable advantages: (a) It provides a simple, intuitive yet effective way to rank the nodes in networks from a new viewpoint; (b) ProfitLeader allows finding the most important nodes (with high quality). (c) ProfitLeader is fully automatic, and no parameters are required to be specified by users. Extensive experiments on both small networks and large-scale networks have demonstrated its superiority over several state-of-the-art algorithms.
KeywordsNetwork mining Critical node identification Profit capacity
This work is supported by the National Natural Science Foundation of China (61403062, 61433014, 41601025), China Postdoctoral Science Foundation (2014M552344,2015M580786), Science-Technology Foundation for Young Scientist of Sichuan Province (2016JQ0007), National key research and development program (2016YFB0502300),and Sichuan province soft science research project (2017ZR0208).
- 1.Aristotle, J.: Betweenness centrality. ACM Sigplan Not. 48(8) (2013)Google Scholar
- 7.Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. World Wide Web 30, 107–117 (1998)Google Scholar
- 8.Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: IEEE International Conference on Data Mining, pp. 88–97 (2010)Google Scholar
- 13.Gao, L., Song, J., Nie, F., Zou, F., Sebe, N., Shen, H.T.: Graph-without-cut: An ideal graph learning for image segmentation. In: Thirtieth AAAI Conference on Artificial Intelligence, pp. 1188–1194 (2016)Google Scholar
- 15.Garas, A., Schweitzer, F., Havlin, S.: A k-shell decomposition method for weighted networks. J. Phys. 14(8), 083,030 (2012)Google Scholar
- 17.Kempe, D., Kleinberg, J., Tardos, É. : Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM (2003)Google Scholar
- 36.Shao, J., Han, Z., Yang, Q., Zhou, T.: Community detection based on distance dynamics. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1075–1084 (2015)Google Scholar
- 39.Song, J., Yang, Y., Li, X., Huang, Z., Yang, Y.: Robust hashing with local models for approximate similarity search. IEEE Trans. Syst. Man Cybern. 44(7), 1225–1236 (2014)Google Scholar
- 41.Song, J., Gao, L., Puscas, M.M., Nie, F., Shen, F., Sebe, N.: Joint graph learning and video segmentation via multiple cues and topology calibration. In: ACM on Multimedia Conference, pp. 831–840 (2016)Google Scholar
- 45.Wang, Z., Du, C., Fan, J., Xing, Y.: Ranking influential nodes in social networks based on node position and neighborhood. Neurocomputing (2017)Google Scholar