Restreaming graph partitioning: Simple versatile algorithms for advanced balancing

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn Part F128815, Issue , 2013, Pages 1106-1114

  Nishimura, Joel ^a   Ugander, Johan ^a  

^a Cornell University ^*  (United States)

Author keywords

Balanced partitioning; Graph clustering; Multi constraint balance; Social networks; Stratified partitioning

Indexed keywords

DATA MINING; GRAPHIC METHODS; ITERATIVE METHODS; OPTIMIZATION; SOCIAL NETWORKING (ONLINE);

BALANCED PARTITIONING; GRAPH CLUSTERING; LARGE-SCALE COMPUTING SYSTEMS; MODELS OF COMPUTATION; MULTI-CONSTRAINTS; OFF-LINE OPTIMIZATION; PARTITIONING ALGORITHMS; STRATIFIED PARTITIONING;

GRAPH THEORY;

EID: 85021199540     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2487575.2487696     Document Type: Conference Paper

References (26)

1. http://snap.stanford.edu/data/.
2. K.J. Ahn, S. Guha, and A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. In PODS, p. 5-14, 2012.
3. M. Barber and J. Clark. Detecting network communities by propagating labels under constraints. Phys Rev E, 80(2):026129, 2009.
4. V. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. J of Statistical Mechanics: Theory and Experiment, 2008(10):10008, 2008.
5. S. P. Borgatti and M. G. Everett. Models of core/periphery structures. Social Networks, 21(4):375-395, 2000.
6. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan. On compressing social networks. In KDD, p. 219-228, 2009.
7. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM J Computing, 31(4):1090-1118, 2002.
8. S. E. Fienberg. A brief history of statistical models for network analysis and open challenges. Journal of Computational and Graphical Statistics, 21(4):825-839, 2012.
9. M. R. Garey and D. S. Johnson. Computers and intractability, 1979.
10. B. H. Good, Y.-A. de Montjoye, and A. Clauset. Performance of modularity maximization in practical contexts. Phys Rev E, 81:046106, 2010.
11. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Computing, 20(1):359-392, 1998.
12. G. Karypis and V. Kumar. Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Review, 41(2):278-300, 1999.
13. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 1970.
14. A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a PC. In OSDI, 2012.
15. J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, p. 695-704, 2008.
16. X. Liu and T. Murata. Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Physica A, 389(7):1493-1500, 2010.
17. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC, 2007.
18. J. Neville, B. Gallagher, T. Eliassi-Rad, and T. Wang. Correcting evaluation bias of relational classifiers with network cross validation. Knowledge and Info Sys, p. 1-25, 2012.
19. M.E.J. Newman. Modularity and community structure in networks. PNAS, 103(23): 8577-8582, 2006.
20. D. A. Spielman and S.-H. Teng. Spectral partitioning works: planar graphs and finite element meshes. In FOCS, p. 96-105, 1996.
21. I. Stanton. Streaming balanced graph partitioning for random graphs. arXiv preprint arXiv:1212.1121, 2012.
22. I. Stanton and G. Kliot. Streaming graph partitioning for large distributed graphs. In KDD, p. 1222-1230, 2012.
23. C. Tsourakakis, C. Gkantsidis, B. Radunovic, and M. Vojnovic. Fennel: Streaming graph partitioning for massive scale graphs. Microsoft Technical Report MSR-TR-2012-113, 2012.
24. J. Ugander and L. Backstrom. Balanced label propagation for partitioning massive graphs. In WSDM, 2013.
25. J. Ugander, B. Karrer, L. Backstrom, and J. Kleinberg. Graph cluster randomization: Network exposure to multiple universes. In KDD, 2013.
26. J. Ugander, B. Karrer, L. Backstrom, and C. Marlow. The anatomy of the facebook social graph. arXiv preprint arXiv:1111.4503, 2011.