Advantage of overlapping clusters for minimizing conductance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7256 LNCS, Issue , 2012, Pages 494-505

  Khandekar, Rohit ^a   Kortsarz, Guy ^b   Mirrokni, Vahab ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c GOOGLE INC   (United States)

Author keywords

dynamic programming; graph clustering; overlapping clustering; tree decomposition

Indexed keywords

APPROXIMATION ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC PROGRAMMING; SOCIAL SCIENCES COMPUTING;

APPROXIMATION RATIOS; COMMUNITY DISCOVERIES; DISJOINT CLUSTERS; GRAPH CLUSTERING; OVERLAPPING CLUSTERING; OVERLAPPING CLUSTERS; REAL DATA SETS; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 84860833067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29344-3_42     Document Type: Conference Paper

References (16)

1. Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475-486 (2006)
2. Andersen, R., Gleich, D., Mirrokni, V.: Overlapping clustering for distributed computation. In: ACM Conference on Web Search and Data Mining (2012)
3. Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. In: STOC, pp. 222-231 (2004)
4. Brandes, U., Gaertler, M.,Wagner, D.: Engineering graph clustering: Models and experimental evaluation. ACM J. Experimental Algorithmics 1(1) (2007)
5. Even, G., Naor, J., Rao, S., Schieber, B.: Fast approximate graph partitioning algorithms. SIAM J. Comput. 28(6), 2187-2214 (1999)
6. Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica 29(3), 410-421 (2001), citeseer.ist.psu.edu/feige99dense.html
7. Gargi, U., Lu, W., Mirrokni, V., Yoon, S.: Large-scale community detection on youtube. In: ICWSM (2011)
8. Gleich, D.: Personal communication (2011)
9. Harrelson, C., Hildrum, K., Rao, S.: A polynomial-time tree decomposition to minimize congestion. In: SPAA, pp. 34-43 (2003)
10. Khandekar, R., Rao, S., Vazirani, U.V.: Graph partitioning using single commodity flows. In: STOC, pp. 385-390 (2006)
11. Lepère, R., Rapine, C.: An Asymptotic O-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 154-165. Springer, Heidelberg (2002)
12. Mishra, N., Schreiber, R., Stanton, I., Tarjan, R.E.: Clustering Social Networks. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 56-67. Springer, Heidelberg (2007)
13. Räcke, H.: Minimizing congestion in general networks. In: FOCS, pp. 43-52 (2002)
14. Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: STOC, pp. 255-264 (2008)
15. Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: STOC, pp. 81-90 (2004)
16. Streich, A.P., Frank, M., Basin, D., Buhmann, J.M.: Multi-assignment clustering for boolean data. In: ICML (2009)