Overlapping clusters for distributed computation

WSDM 2012 - Proceedings of the 5th ACM International Conference on Web Search and Data Mining

Volumn , Issue , 2012, Pages 273-282

  Andersen, Reid ^a   Gleich, David F ^b   Mirrokni, Vahab ^c  

^a MICROSOFT   (United States)

^b PURDUE UNIVERSITY   (United States)

^c GOOGLE INC   (United States)

Author keywords

Conductance; Covering; Diffusion; Leave time; PageRank

Indexed keywords

COVERING; DIFFUSION PROCESS; DISJOINT SETS; DISTRIBUTED COMPUTATIONS; GRAPH DECOMPOSITIONS; ILLUSTRATIVE EXAMPLES; INFORMATION NETWORKS; LEAVE-TIME; OVERLAPPING CLUSTERS; PAGERANK; RANDOM WALK; VERTEX SET;

COMMUNICATION; DATA MINING; DIFFUSION; ELECTRIC CONDUCTANCE; GRAPH THEORY; INFORMATION RETRIEVAL; INFORMATION SERVICES; LINEAR SYSTEMS; WEBSITES;

CLUSTERING ALGORITHMS;

EID: 84858010856     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2124295.2124330     Document Type: Conference Paper

References (40)

1. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466:761-764,2009.
2. R. Andersen. A local algorithm for finding dense subgraphs. In SODA, pages 1003-1009, 2008.
3. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using PageRank vectors. In FOCS, 2006.
4. S. Arora, S. Rao, and U. V. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), 2009.
5. P. Berman and M. Karpinski. Approximation hardness of bounded degree min-csp and min-bisection. In Automata, Languages and Programming, volume 2380 of LNCS, pages 782-782. Springer Berlin / Heidelberg, 2002.
6. R. Bru, F. Pedroche, and D. B. Szyld. Additive Schwarz iterations for Markov chains. SIAM J. Matrix Anal. Appl., 27(2):445-458, 2005.
7. R. Bru, F. Pedroche, and D. B. Szyld. Cálculo del vector PageRank de Google mediante el método iterativo de Schwarz. In J. P. A. et al., editor, Congreso de Métodos Numéricos en Ingeniería, Granada, Spain, 2005. In Spanish.
8. T. N. Bui and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett., 42(3):153-159, 1992.
9. U. V. Çatalyürek and C. Aykanat. Hypergraph-partitioningbased decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst., 10(7):673-693, 1999. (Pubitemid 30500688)
10. A. J. Cole and D. Wishart. An improved algorithm for the Jardine-Sibson method of generating overlapping clusters. The Computer Journal, 13(2):156-163, 1970.
11. A. Czumaj, O. Goldreich, D. Ron, C. Seshadhri, A. Shapira, and C. Sohler. Finding cycles and trees in sublinear time. arXiv, cs.DM:1007.4230, 2010.
12. T. A. Davis and Y. Hu. The University of Florida Sparse Matrix Collection. Submitted., 2010.
13. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors a multilevel approach. IEEE Trans. Pattern Anal. Mach. Intell., 29(11):1944-1957, November 2007. (Pubitemid 47430448)
14. J. Dongarra, I. Foster, G. Fox, W. Gropp, K. Kennedy, L. Torczon, and A. White. The Sourcebook of Parallel Computing. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003.
15. S. Fortunato. Community detection in graphs. arXiv, physics.soc-ph:0906. 0612v2, 2010.
16. D. Fritzsche, A. Frommer, and D. B. Szyld. Overlapping blocks by growing a partition with applications to preconditioning. Technical Report 10-07-26, Department of Mathematics, Temple University, October 2011.
17. S. L. Graham, M. Snir, and C. A. Patterson, editors. Getting up to Speed: The Future of Supercomputing. National Academies Press, 2005.
18. B. Hendrickson and T. G. Kolda. Graph partitioning models for parallel computing. Parallel Comput., 26(12):1519-1534, November 2000.
19. S. Kale and C. Seshadhri. Combinatorial approximation algorithms for maxcut using random walks. In Innovations in Computer Science, pages 367-388, 2011.
20. H. Karloff, S. Suri, and S. Vassilvitskii. A model of computation for mapreduce. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '10, pages 938-948, Philadelphia, PA, USA, 2010. Society for Industrial and Applied Mathematics.
21. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359-392, 1998. (Pubitemid 128689516)
22. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39-43, March 1953.
23. R. Khandekar, G. Kortsarz, and V. Mirrokni. On the advantage of overlapping clusters for minimizing conductance. In LATIN, 2012.
24. S. Khot. Ruling out ptas for graph min-bisection, densest subgraph and bipartite clique. In FOCS, pages 136-145, Washington, DC, USA, 2004. IEEE Computer Society. (Pubitemid 40575275)
25. F. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
26. J. Leskovec. The Stanford large network dataset collection. http://snap.stanford.edu/data/index.html, 2010.
27. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, pages 695-704, New York, NY, USA, 2008. ACM.
28. A. A. Maleev. On the SOR method with overlapping subsystems. Comp. Math. and Math. Phys., 46(6):919-929, June 2006. (Pubitemid 44084308)
29. F. McSherry. A uniform approach to accelerated PageRank computation. In WWW, pages 575-582, 2005.
30. N. Mishra, R. Schreiber, I. Stanton, and R. E. Tarjan. Clustering social networks. In WAW2007, pages 56-67, 2007.
31. M. Mohiyuddin, M. Hoemmen, J. Demmel, and K. Yelick. Minimizing communication in sparse matrix solvers. In SC09, pages 1-12, New York, NY, USA, November 2009. ACM.
32. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford University, November 1999.
33. J. X. Parreira, C. Castillo, D. Donato, S. Michel, and G. Weikum. The juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network. The VLDB Jour., 17(2):291-313, March 2008.
34. A. D. Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Near-optimal sublinear time bounds for distributed random walks. arXiv, cs.DS:0911.3195, 2009.
35. D. A. Spielman and S.-H. Teng. Spectral partitioning works: Planar graphs and finite element meshes. In FOCS, pages 96-105, 1996.
36. A. P. Streich, M. Frank, D. Basin, and J. M. Buhmann. Multiassignment clustering for boolean data. In ICML, 2009.
37. D. B. Szyld and A. Frommer. Weighted max norms, splittings, and overlapping additive schwarz iterations. Numerische Mathematik, 83:259-278, 1999.
38. Ümit V. Çatalyürek and C. Aykanat. A fine-grain hypergraph model for 2d decomposition of sparse matrices. In PDPS, pages 1199-1204, April 2001.
39. Various. The Library of Congress subject headings. http://id. loc.gov, 2009. Accessed in September 2009.
40. D. Zhou, J. Huang, and B. Schölkopf. Learning from labeled and unlabeled data on a directed graph. In ICML '05: Proceedings of the 22nd International Conference on Machine Learning, pages 1036-1043, New York, NY, USA, 2005. ACM Press.