Efficient Maximum Closeness Centrality Group Identification

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9877)

Abstract

As a key concept in the social networks, closeness centrality is widely adopted to measure the importance of a node. Many efficient algorithms are developed in the literature to find the top-k closeness centrality nodes. In most of the previous work, nodes are treated as irrelevant individuals for a top-k ranking. However, in many applications, it is required to find a set of nodes that is the most important as a group. In this paper, we extend the concept of closeness centrality to a set of nodes. We aim to find a set of k nodes that has the largest closeness centrality as a whole. We show that the problem is NP-hard, and prove that the objective function is monotonic and submodular. Therefore, the greedy algorithm can return a result with \(1-1/e\) approximation ratio. In order to handle large graphs, we propose a baseline sampling algorithm (BSA). We further improve the sampling approach by considering the order of samples and reducing the marginal gain update cost, which leads to our order based sampling algorithm (OSA). Finally, extensive experiments on four real world social networks demonstrate the efficiency and effectiveness of the proposed methods.

Keywords

Closeness centrality Random sampling Top-k Shortest path distance 

References

  1. 1.
    Abboud, A., Grandoni, F., Williams, V.V.: Subcubic equivalences between graph centrality problems, APSP and diameter. In: SODA, pp. 1681–1697 (2015)Google Scholar
  2. 2.
    Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245–248 (2009)CrossRefGoogle Scholar
  3. 3.
    Bavelas, A.: A mathematical model for small group structures. Hum. Organ. (1948)Google Scholar
  4. 4.
    Bavelas, A.: Communication patterns in task oriented groups. J. Acoust. Soc. Am. 22(6), 726–730 (1950)CrossRefGoogle Scholar
  5. 5.
    Bonacich, P., Lloyd, P.: Eigenvector centrality and structural zeroes and ones: when is a neighbor not a neighbor? Soc. Netw. 43, 86–90 (2015)CrossRefGoogle Scholar
  6. 6.
    Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25, 163–177 (2001)CrossRefMATHGoogle Scholar
  7. 7.
    Chechik, S., Cohen, E., Kaplan, H.: Average distance queries through weighted samples in graphs and metric spaces: high scalability with tight statistical guarantees. In: APPROX/RANDOM (2015)Google Scholar
  8. 8.
    Cohen, E.: All-distances sketches, revisited: HIP estimators for massive graphs analysis. In: PODS (2014)Google Scholar
  9. 9.
    Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Computing classic closeness centrality, at scale. In: COSN (2014)Google Scholar
  10. 10.
    Eppstein, D., Wang, J.: Fast approximation of centrality. In: SODA (2001)Google Scholar
  11. 11.
    Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1, 215–239 (1978)CrossRefGoogle Scholar
  12. 12.
    Indyk, P.: Sublinear time algorithms for metric space problems. In: STOC (1999)Google Scholar
  13. 13.
    Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 186–195. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Olsen, P.W., Labouseur, A.G., Hwang, J.: Efficient top-k closeness centrality search. In: ICDE (2014)Google Scholar
  15. 15.
    Rattigan, M.J., Maier, M., Jensen, D.: Graph clustering with network structure indices. In: ICML, pp. 783–790 (2007)Google Scholar
  16. 16.
    Thorup, M.: Quick k-Median, k-Center, and facility location for sparse graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 249. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  17. 17.
    Wasserman, S., Faust, K.: Social network analysis: methods and applications. Cambridge University Press, Cambridge (1994)Google Scholar
  18. 18.
    Zhao, J., Lui, J.C., Towsley, D., Guan, X.: Measuring and maximizing group closeness centrality over disk-resident graphs. In: WWW 2014 Companion, pp. 689–694 (2014)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.The University of New South WalesSydneyAustralia
  2. 2.University of TechnologySydneyAustralia

Personalised recommendations