Abstract
Centrality metrics are used to find important nodes in social networks. In the days of ever-increasing social network sizes, it becomes more and more difficult to compute centrality scores of all nodes quickly. One of the ways to tackle this problem is to use approximation centrality algorithms using sampling techniques. Also, in situations where finding only high value individuals/important nodes is the primary objective, accuracy of rank ordering of nodes is especially important. We propose a new sampling method similar to Tabu search, called “penalty box approach,” which can be used for approximation closeness and betweenness algorithms. On a variety of graphs we experimentally demonstrate that this new method when combined with previously known methods, such as random sampling and linear scaling, produces better results. The evaluation is done based on two measures that assess quality of rank ordered lists of nodes when compared against the true lists based on their closeness and betweenness scores. Effects of graph characteristics on the parameters of the proposed method are also analyzed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal M, Singh RR, Chaudhary S, Iyengar S (2015) An efficient estimation of a node’s betweenness. In: Complex networks VI. Springer, New York. pp. 111–121
Bader DA, Madduri K (2006) Parallel algorithms for evaluating centrality indices in real-world networks. In: Parallel processing, 2006. ICPP 2006. International Conference on, IEEE. pp. 539–550
Bader DA, Kintali S, Madduri K, Mihail M (2007) Approximating betweenness centrality. In: Algorithms and models for the web-graph. Springer, New York, pp. 124–137
Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512
Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177
Brandes U, Pich C (2007) Centrality estimation in large networks. Int J Bifurc Chaos 17(07):2303–2318
Dutot A, Guinand F, Olivier D, Pigné Y et al. (2007) Graphstream: a tool for bridging the gap between complex systems and dynamic graphs. In: Emergent properties in natural and artificial complex systems. Satellite conference within the 4th European conference on complex systems (ECCS’2007)
Eppstein D, Wang J (2004) Fast approximation of centrality. J Graph Algorithm Appl 8:39–45
Erdos D, Ishakian V, Bestavros A, Terzi E (2014) A divide-and-conquer algorithm for betweenness centrality. arXiv preprint arXiv:14064173
Freeman L (1979) Centrality in social networks conceptual clarification. Soc Netw 1(3):215–239
Geisberger R, Sanders P, Schultes D (2008) Better approximation of betweenness centrality. In: ALENEX, SIAM, pp. 90–100
Gkorou D, Pouwelse J, Epema D, Kielmann T, van Kreveld M, Niessen W (2010) Efficient approximate computation of betweenness centrality. In: 16th annual conference of the advanced school for computing and imaging (ASCI 2010)
Glover F (1989) Tabu search-part i. ORSA J Comput 1(3):190–206
Heidemann J, Klier M, Probst F (2010) Identifying key users in online social networks: a pagerank based approach. Proc 31st information system international conference, StLouis, MO, USA
Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58(301):13–30
Jacob R, Koschützki D, Lehmann K, Peeters L, Tenfelde-Podehl D (2005) Algorithms for centrality indices. Netw Anal pp. 62–82
Jippes E, Achterkamp MC, Brand PL, Kiewiet DJ, Pols J, van Engelen JM (2010) Disseminating educational innovations in health care practice: training versus social networks. Soc Sci & Med 70(10):1509–1517
Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp. 137–146
Kendall MG (1988) A new measure of rank correlation. Biometrika 4:81–93
Kourtellis N, Alahakoon T, Simha R, Iamnitchi A, Tripathi R (2013) Identifying high betweenness centrality nodes in large social networks. Soc Netw Anal Min 3(4):899–914
Krebs VE (2002) Mapping networks of terrorist cells. Connections 24(3):43–52
Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on world wide web companion, international world wide web conferences steering committee, pp. 1343–1350
Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http://snap.stanford.edu/data
Okamoto K, Chen W, Li XY (2008) Ranking of closeness centrality for large-scale social networks. In: Frontiers in algorithmics, Springer, New York, pp. 186–195
Opsahl T, Agneessens F, Skvoretz J (2010) Node centrality in weighted networks: generalizing degree and shortest paths. Soc Netw 32(3):245–251
Riondato M, Kornaropoulos EM (2014) Fast approximation of betweenness centrality through sampling. In: Proceedings of the 7th ACM international conference on Web search and data mining, ACM, pp. 413–422
Wasserman S (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge
Watts DJ, Strogatz SH (1998) Collective dynamics of ‘Small-world’ Networks. Nature 393(6684):440–442
Acknowledgments
This material is based in part on work supported by the Intelligence Advanced Research Projects Activity (IARPA) via Air Force Research Laboratory contract number FA8650-10-C-7062. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright annotation thereon.
Disclaimer
The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of IARPA, AFRL or the U.S. Government.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
Rights and permissions
About this article
Cite this article
Khopkar, S.S., Nagi, R. & Tauer, G. A penalty box approach for approximation betweenness and closeness centrality algorithms. Soc. Netw. Anal. Min. 6, 4 (2016). https://doi.org/10.1007/s13278-015-0308-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-015-0308-7