Scalable multi-threaded community detection in social networks

Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012

Volumn , Issue , 2012, Pages 1619-1628

  Riedy, Jason ^a   Bader, David A ^a   Meyerhenke, Henning ^b  

^a Georgia Institute of Technology   (United States)

^b KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

community detection; modularity; parallel

Indexed keywords

COMMUNITY DETECTION; COMMUNITY DETECTION ALGORITHMS; CURRENT ANALYSIS; EXCELLENT PERFORMANCE; MODULARITY; MULTITHREADED; PARALLEL; PARALLEL SCALABILITY; SOCIAL NETWORKS; SUBGRAPHS;

ALGORITHMS; APPLICATION PROGRAMMING INTERFACES (API); DISTRIBUTED PARAMETER NETWORKS; POPULATION DYNAMICS; SIGNAL DETECTION;

PARALLEL PROCESSING SYSTEMS;

EID: 84867423946     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2012.203     Document Type: Conference Paper

References (38)

1. Facebook, Inc., "User statistics," March 2011, http://www.facebook.com/press/info.php?statistics.
2. Twitter, Inc., "Happy birthday Twitter!" March 2011, http://blog.twitter.com/2011/03/happy-birthday-twitter.html.
3. NYSE Euronext, "Consolidated volume in NYSE listed issues, 2010 - current," March 2011, http://www.nyxdata.com/nysedata/asp/factbook/viewer- edition.asp?mode=table&key=3139&category=3.
4. E. J. Riedy, H. Meyerhenke, D. Ediger, and D. A. Bader, "Parallel community detection for massive graphs," in Proc. 9th International Conference on Parallel Processing and Applied Mathematics, Torun, Poland, Sep. 2011.
5. M. Newman and M. Girvan, "Finding and evaluating community structure in networks," Phys. Rev. E, vol. 69, no. 2, p. 026113, Feb 2004.
6. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, "Defining and identifying communities in networks," Proc. of the National Academy of Sciences, vol. 101, no. 9, p. 2658, 2004.
7. D. M. Wilkinson and B. A. Huberman, "A method for finding communities of related genes," Proceedings of the National Academy of Sciences of the United States of America, vol. 101, no. Suppl 1, pp. 5241-5248, 2004.
8. S. Lozano, J. Duch, and A. Arenas, "Analysis of large social datasets by community detection," The European Physical Journal - Special Topics, vol. 143, pp. 257-259, 2007.
9. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A.-L. Barabási, "Hierarchical organization of modularity in metabolic networks," Science, vol. 297, no. 5586, pp. 1551-1555, 2002.
10. S. Fortunato, "Community detection in graphs," Physics Reports, vol. 486, no. 3-5, pp. 75-174, 2010.
11. B. O. F. Auer and R. H. Bisseling, "10th DIMACS implementation challenge: Graph coarsening and clustering on the gpu," 2012, http://www.cc.gatech.edu/dimacs10/papers/[16]-gpucluster.pdf.
12. R. Görke, A. Schumm, and D. Wagner, "Experiments on density-constrained graph clustering," in Proc. Algorithm Engineering and Experiments (ALENEX12), 2012.
13. A. Clauset, M. Newman, and C. Moore, "Finding community structure in very large networks," Physical Review E, vol. 70, no. 6, p. 66111, 2004.
14. Y. Zhang, J. Wang, Y. Wang, and L. Zhou, "Parallel community detection on large networks with propinquity dynamics," in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, ser. KDD '09. New York, NY, USA: ACM, 2009, pp. 997-1006.
15. J. Gehweiler and H. Meyerhenke, "A distributed diffusive heuristic for clustering a virtual P2P supercomputer," in Proc. 7th High-Performance Grid Computing Workshop (HGCW'10) in conjunction with 24th Intl. Parallel and Distributed Processing Symposium (IPDPS'10). IEEE Computer Society, 2010.
16. A. Noack and R. Rotta, "Multi-level algorithms for modularity clustering," in Experimental Algorithms, ser. Lecture Notes in Computer Science, J. Vahrenhold, Ed. Springer, 2009, vol. 5526, pp. 257-268.
17. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," J. Stat. Mech, p. P10008, 2008.
18. G. Karypis and V. Kumar, "Multilevel k-way partitioning scheme for irregular graphs," Journal of Parallel and Distributed Computing, vol. 48, no. 1, pp. 96-129, 1998.
19. M. Holtgrewe, P. Sanders, and C. Schulz, "Engineering a scalable high quality graph partitioner," in Proc. 24th IEEE Intl. Symposium on Parallel and Distributed Processing (IPDPS'10), 2010, pp. 1-12.
20. D. Bader and J. McCloskey, "Modularity and graph algorithms," Sep. 2009, presented at UMBC.
21. M. Newman, "Modularity and community structure in networks," Proc. of the National Academy of Sciences, vol. 103, no. 23, pp. 8577-8582, 2006.
22. R. Andersen and K. Lang, "Communities from seed sets," in Proc. of the 15th Int'l Conf. on World Wide Web. ACM, 2006, p. 232.
23. R. Preis, "Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs," in STACS 99, ser. Lecture Notes in Computer Science, C. Meinel and S. Tison, Eds. Springer Berlin / Heidelberg, 1999, vol. 1563, pp. 259-269.
24. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner, "On modularity clustering," IEEE Trans. Knowledge and Data Engineering, vol. 20, no. 2, pp. 172-188, 2008.
25. J.-H. Hoepman, "Simple distributed weighted matchings," CoRR, vol. cs.DC/0410047, 2004.
26. F. Manne and R. Bisseling, "A parallel approximation algorithm for the weighted maximum matching problem," in Parallel Processing and Applied Mathematics, ser. Lecture Notes in Computer Science, R. Wyrzykowski, J. Dongarra, K. Karczewski, and J. Wasniewski, Eds. Springer, 2008, vol. 4967, pp. 708-717.
27. D. Bader, H. Meyerhenke, P. Sanders, and D. Wagner, "Competition rules and objective functions for the 10th DIMACS Implementation Challenge on graph partitioning and graph clustering," Sep. 2011, http://www.cc.gatech. edu/dimacs10/data/dimacs10-rules.pdf.
28. K. Wakita and T. Tsurumi, "Finding community structure in mega-scale social networks," CoRR, vol. abs/cs/0702048, 2007.
29. P. Konecny, "Introducing the Cray XMT," in Proc. Cray User Group meeting (CUG 2007). Seattle, WA: CUG Proceedings, May 2007.
30. OpenMP Application Program Interface; Version 3.0, OpenMP Architecture Review Board, May 2008.
31. D. Bader and K. Madduri, "SNAP, small-world network analysis and partitioning: an open-source parallel graph framework for the exploration of large-scale networks," in Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS), 2008.
32. D. Chakrabarti, Y. Zhan, and C. Faloutsos, "R-MAT: A recursive model for graph mining," in Proc. 4th SIAM Intl. Conf. on Data Mining (SDM). Orlando, FL: SIAM, Apr. 2004.
33. D. Bader, J. Gilbert, J. Kepner, D. Koester, E. Loh, K. Madduri, W. Mann, and T. Meuse, HPCS SSCA#2 Graph Analysis Benchmark Specifications v1.1, Jul. 2005.
34. J. Leskovec, "Stanford large network dataset collection," At http://snap.stanford.edu/data/, Oct. 2011.
35. P. Boldi, B. Codenotti, M. Santini, and S. Vigna, "Ubicrawler: A scalable fully distributed web crawler," Software: Practice & Experience, vol. 34, no. 8, pp. 711-726, 2004.
36. C. Seshadhri, T. G. Kolda, and A. Pinar, "Community structure and scale-free collections of erdös-rényi graphs," CoRR, vol. abs/1112.3644, 2011.
37. A. Buluç and J. R. Gilbert, "The Combinatorial BLAS: design, implementation, and applications," International Journal of High Performance Computing Applications, vol. 25, no. 4, pp. 496-509, 2011. [Online]. Available: http://hpc.sagepub.com/content/25/4/496.abstract
38. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: a system for large-scale graph processing," in Proceedings of the 2010 international conference on Management of data, ser. SIGMOD '10. New York, NY, USA: ACM, 2010, pp. 135-146.