Advertisement

Parallel computation of hierarchical closeness centrality and applications

  • Hai Jin
  • Chen Qian
  • Dongxiao YuEmail author
  • Qiang-Sheng Hua
  • Xuanhua Shi
  • Xia Xie
Article
  • 122 Downloads
Part of the following topical collections:
  1. Special Issue on Social Computing and Big Data Applications

Abstract

It has long been an area of interest to identify important vertices in social networks. Closeness centrality is one of the most popular measures of centrality of vertices. Generally speaking, it measures how a node is close to all other nodes on average. However, closeness centrality measures the centrality from a global view. Consequently, in real-world networks that is normally composed by some communities connected, using closeness centrality may suffer from the flaw that local central vertices within communities are neglected. To resolve this issue, we propose a new centrality measure, Hierarchical Closeness Centrality (HCC), to depict the local centrality of vertices. Experiments show that comparing with closeness centrality, HCC is a better index in finding most influential vertices and community detection. Furthermore, we present a parallel algorithm for HCC computation, by well analyzing the independence between vertices in the computation procedure. Extensive experiments on real-world datesets demonstrate that the parallel algorithm can greatly reduce the computation time compared to trivial algorithms.

Keywords

Data mining Closeness centrality Parallel algorithm 

Notes

Acknowledgements

This work is supported by the National Key Research and Development Program of China No.2017YFC0803700, the National Natural Science Foundation of China Grants 61602195, 61572216, 61433019 and U1435217, Natural Science Foundation of Hubei Province 2017CFB301, the Outstanding Youth Foundation of Hubei Province 2016CFA032, and Fundamental Research Funds for HUST.

References

  1. 1.
    Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Exp. Math. 10(1), 53–66 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Al-Baghdadi, A.: Computing Top-K Closeness Centrality in Unweighted Undirected Graphs Revisited. Ph.D. thesis (2017)Google Scholar
  3. 3.
    Bargigli, L., Gallegati, M.: Finding communities in credit networks. Economics 7(17), 1 (2013)Google Scholar
  4. 4.
    Bavelas, A.: Communication Patterns in Task-Oriented Groups. J. Acoust. Soc. Am. 22(6), 725–730 (1950)CrossRefGoogle Scholar
  5. 5.
    Bergamini, E., Borassi, M., Crescenzi, P., Marino, A., Meyerhenke, H.: Computing top-k closeness centrality faster in unweighted graphs. In: Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX), vol. V, pp. 68–80 (2016)Google Scholar
  6. 6.
    Brandes, U., Pich, C.: Centrality estimation in large networks. Other 17(7), 2303–2318 (2007)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Cutts, M.: How does Google collect and rank results? http://www.google.com/librariancenter/articles/0601_03.html (2010)
  8. 8.
    Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of the of the OSDI, pp. 137–149 (2004)Google Scholar
  9. 9.
    Eppstein, D., Wang, J.: Fast Approximation of Centrality. J. Graph Algorithms Appl. 8(1), 2 (2000)MathSciNetGoogle Scholar
  10. 10.
    Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35 (1977)CrossRefGoogle Scholar
  11. 11.
    Fu, L., Gao, L., Ma, X.: A centrality measure based on spectral optimization of modularity density. Sci. China Inf. Sci. 53(9), 1727–1737 (2010)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Girvan, M., Newman, M. E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Gu, Q., Xiong, S., Chen, D.: Correlations between characteristics of maximum influence and degree distributions in software networks. Sci. China Inf. Sci. 57(7), 1–12 (2014)CrossRefGoogle Scholar
  14. 14.
    Hossmann, T., Spyropoulos, T., Legendre, F.: A complex network analysis of human mobility. In: 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 876–881 (2011)Google Scholar
  15. 15.
    Inariba, W.: Random-radius ball method for estimating closeness centrality. In: Proceedings of the 31th Conference on Artificial Intelligence (AAAI 2017), pp. 125–131 (2017)Google Scholar
  16. 16.
    Kang, U.: Centralities in large networks: algorithms and observations. In: SIAM International Conference on Data, pp. 119–130 (2011)Google Scholar
  17. 17.
    Mora, R., Gutierrez, C.: Random-walk closeness centrality satisfies boldi-vigna axioms. In: CEUR Workshop Proceedings, vol. 1378, pp. 110–120 (2015)Google Scholar
  18. 18.
    Okamoto, K., Chen, W., Li, X.Y.: Ranking of closness centrality for large-scale social networks. In: Proceedings of the 2nd Annual International Workshop on Frontiers in Algorithmics, pp. 186–195 (2008)Google Scholar
  19. 19.
    Olsen, P.W., Labouseur, A.G., Hwang, J.H.: Efficient top-k closeness centrality search. In: Proceedings of ICDE, pp. 196–207 (2014)Google Scholar
  20. 20.
    Olsen, PW Jr., Labouseur, A.G., Hwang, J.H.: Efficient top-k closeness centrality search 196–207 (2014)Google Scholar
  21. 21.
    Sah, P., Singh, L. O., Clauset, A., Bansal, S.: Exploring community structure in biological networks with random graphs. BMC Bioinf. 15(1), 220 (2014)CrossRefGoogle Scholar
  22. 22.
    Sariyüce, A.E., Saule, E., Kaya, K., Çatalyürek, Ü.V.: Incremental closeness centrality in distributed memory. Parallel Comput. 47, 3–18 (2015)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Zhuang, H., Sun, Y., Tang, J., Zhang, J., Sun, X.: Influence maximization in dynamic social networks. In: 2013 IEEE 13th International Conference on Data Mining (ICDM). IEEE, pp. 1313–1318 (2013)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Services Computing Technology and System Lab, Big Data Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanPeople’s Republic of China

Personalised recommendations