In-core computation of geometric centralities with HyperBall: A hundred billion nodes and beyond

Proceedings - IEEE 13th International Conference on Data Mining Workshops, ICDMW 2013

Volumn , Issue , 2013, Pages 621-628

  Boldi, Paolo ^a   Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Centrality; Distance distribution; Graph algorithms; Probabilistic counters

Indexed keywords

APPROXIMATION ALGORITHMS; DATA MINING; GEOMETRY; PROBABILITY DISTRIBUTIONS; RANDOM ACCESS STORAGE;

ALL PAIRS SHORTEST PATHS; BREADTH-FIRST TRAVERSAL; CENTRALITY; DISTANCE DISTRIBUTIONS; GRAPH ALGORITHMS; MAPREDUCE FRAMEWORKS; PROBABILISTIC COUNTERS; STATISTICAL GUARANTEE;

GRAPH THEORY;

EID: 84898020573     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2013.10     Document Type: Conference Paper

References (24)

1. A. Bavelas, "A mathematical model for group structures," Human Organization, vol. 7, pp. 16-30, 1948.
2. P. Boldi and S. Vigna, "Axioms for centrality," CoRR, vol. abs/1308.2140, 2013.
3. P. Boldi, M. Rosa, and S. Vigna, "HyperANF: Approximating the neighbourhood function of very large graphs on a budget," in Proceedings of the 20th international conference on World Wide Web, S. Srinivasan, K. Ramamritham, A. Kumar, M. P. Ravindra, E. Bertino, and R. Kumar, Eds. ACM, 2011, pp. 625-634.
4. J. Dean and S. Ghemawat, "Mapreduce: Simplified data processing on large clusters," in OSDI '04: Sixth Symposium on Operating System Design and Implementation, 2004, pp. 137-150.
5. U. Kang, S. Papadimitriou, J. Sun, and H. Tong, "Centralities in large networks: Algorithms and observations," in Proceedings of the Eleventh SIAM International Conference on Data Mining. SIAM / Omnipress, 2011, pp. 119-130.
6. S. P. Borgatti, "Centrality and network flow," Social Networks, vol. 27, no. 1, pp. 55-71, 2005.
7. L. Backstrom, P. Boldi, M. Rosa, J. Ugander, and S. Vigna, "Four degrees of separation," in ACM Web Science 2012: Conference Proceedings. ACM Press, 2012, pp. 45-54, best paper award.
8. A. Bavelas, "Communication patterns in task-oriented groups." Journal of the Acoustical Society of America, 1950.
9. N. Lin, Foundations of Social Research. New York: McGraw-Hill, 1976.
10. P. Boldi and S. Vigna, "Axioms for centrality," Internet Math., 2014, to appear.
11. M. Marchiori and V. Latora, "Harmony in the small-world," Physica A: Statistical Mechanics and its Applications, vol. 285, no. 3-4, pp. 539-546, 2000.
12. C. R. Palmer, P. B. Gibbons, and C. Faloutsos, "Anf: a fast and scalable tool for data mining in massive graphs," in KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2002, pp. 81-90.
13. P. Flajolet, É. Fusy, O. Gandouet, and F. Meunier, "HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm," in Proceedings of the 13th conference on analysis of algorithm (AofA 07), 2007, pp. 127-146.
14. M. Durand and P. Flajolet, "Loglog counting of large cardinalities (extended abstract)," in Algorithms-ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, ser. Lecture Notes in Computer Science, G. D. Battista and U. Zwick, Eds., vol. 2832. Springer, 2003, pp. 605-617.
15. U. Kang, C. E. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec, "HADI: Mining radii of large graphs," ACM Transactions on Knowledge Discovery from Data, vol. 5, no. 2, pp. 8:1-8:24, 2011.
16. E. Cohen, "All-distances sketches, revisited: Scalable estimation of the distance distribution and centralities in massive graphs," CoRR, vol. abs/1306.3284, 2013.
17. P. Boldi and S. Vigna, "The WebGraph framework I: Compression techniques," in Proc. of the Thirteenth International World Wide Web Conference (WWW 2004). Manhattan, USA: ACM Press, 2004, pp. 595-601.
18. S. Vigna, "Broadword implementation of rank/select queries," in Experimental Algorithms. 7th International Workshop, WEA 2008, ser. Lecture Notes in Computer Science, C. C. McGeoch, Ed., no. 5038. Springer-Verlag, 2008, pp. 154-168.
19. P. Elias, "Efficient storage and retrieval by content and address of static files," J. Assoc. Comput. Mach., vol. 21, no. 2, pp. 246-260, 1974.
20. L. Roditty and V. V. Williams, "Fast approximation algorithms for the diameter and radius of sparse graphs," in Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, D. Boneh, T. Roughgarden, and J. Feigenbaum, Eds. ACM, 2013, pp. 515-524.
21. K. Järvelin and J. Kekäläinen, "Cumulated gain-based evaluation of ir techniques," ACM Trans. Inf. Syst., vol. 20, no. 4, pp. 422-446, 2002.
22. L. Katz, "A new status index derived from sociometric analysis," Psychometrika, vol. 18, no. 1, pp. 39-43, 1953.
23. E. Cohen and H. Kaplan, "Spatially-decaying aggregation over a network," Journal of Computer and System Sciences, vol. 73, no. 3, pp. 265-288, 2007.
24. P. Boldi and S. Vigna, "Four degrees of separation, really," in Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). IEEE Computer Society, 2012, pp. 1222-1227.