Scalable discovery of best clusters on large graphs

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 693-702

  Macropol, Kathy ^a   Singh, Ambuj ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

BIOLOGICAL FUNCTIONS; CLUSTERING APPLICATIONS; CLUSTERING TECHNIQUES; CONNECTED COMPONENT; GRAPH CLUSTERING ALGORITHMS; OVERLAPPING CLUSTERS; REAL-WORLD DATASETS; SOCIAL COMMUNITIES;

CLUSTERING ALGORITHMS;

EID: 80052767847     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920930     Document Type: Article

References (32)

1. A. Abourjeili and G. Karypis. Multilevel algorithms for partitioning power-law graphs. In IPDPS, pages 16-575, 2006.
2. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, pages 475-486, Washington, DC, USA, 2006. IEEE Computer Society.
3. B. Andreopoulos, A. An, X. Wang, and M. Schroeder. A roadmap of clustering algorithms: finding a match for a biomedical application. Brief Bioinform, 10(4):297-314, May 2009.
4. M. Ashburner and et. al. Gene ontology: tool for the unification of biology. The Gene Ontology Consortium. Nat Genet, 25(1):25-29, May 2000.
5. G. D. Bader and C. W. V. Hogue. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics, 4(2), 2003.
6. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. Comput. Netw. ISDN Syst., 29(8-13):1157-1166, 1997.
7. S. Brohee and J. van Helden. Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinformatics, 7:488, November 2006.
8. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In In SDM, 2004.
9. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. pages 137-150.
10. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors: A multilevel approach. TPAMI, 29(11):1944-1957, 2007.
11. S. Fortunato. Community detection in graphs. Physics Reports, 486:75-174, Feb. 2010.
12. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518-529, 1999.
13. T. H. Haveliwala, A. Gionis, and P. Indyk. Scalable techniques for clustering the web (extended abstract). In WebDB, 2000.
14. P. Indyk. A small approximately min-wise independent family of hash functions. In SODA '99, pages 454-456, 1999.
15. R. Kannan, S. Vempala, and A. Vetta.4 On clusterings: Good, bad and spectral. J. ACM, 51(3):497-515, May 2004.
16. E. F. Krause. Maximizing the product of summands; minimizing the sum of factors. Mathematics Magazine, 69(4):270-278, 1996.
17. I. Lee, Z. Li, and E. M. Marcotte. An improved, bias-reduced probabilistic functional gene network of baker's yeast, saccharomyces cerevisiae. PloS one, 2(10):e988+, October 2007.
18. J. Leskovec. Stanford network analysis package (snap). http://snap.stanford.edu/.
19. J. Leskovec, L. A. Adamic, and B. A. Huberman. The dynamics of viral marketing. In EC, pages 228-237, New York, NY, USA, 2006. ACM.
20. J. Leskovec, D. Huttenlocher, and J. Kleinberg. Signed networks in social media. In CHI, 2010.
21. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Technical Report arXiv:0810.1355, 2008.
22. K. Macropol, T. Can, and A. Singh. RRW: repeated random walks on genome-scale protein networks for local cluster discovery. BMC Bioinformatics, 10(1):283, 2009.
23. N. Mishra, R. Schreiber, I. Stanton, and R. E. Tarjan. Clustering social networks. In WAW, pages 56-67, 2007.
24. C. L. Myers, D. R. Barrett, M. A. Hibbs, C. Huttenhower, and O. G. Troyanskaya. Finding function: evaluation methods for functional genomic data. BMC genomics, 7:187, 2006 2006.
25. V. Satuluri and S. Parthasarathy. Scalable graph clustering using stochastic flows: applications to community discovery. In KDD, pages 737-746, New York, NY, USA, 2009. ACM.
26. J. Shi and J. Malik. Normalized cuts and image segmentation. TPAMI, 22:888-905, 1997.
27. D. A. Spielman and S.-H. Teng. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR, abs/0809.3232, 2008.
28. A. P. Streich, M. Frank, D. Basin, and J. M. Buhmann. Multi-assignment clustering for boolean data. In ICML, pages 969-976, New York, NY, USA, 2009. ACM.
29. S. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, Utrecht, May 2000.
30. W.-S. Yang, J.-B. Dia, H.-C. Cheng, and H.-T. Lin. Mining social networks for targeted advertising. In HICSS, page 137.1, 2006.
31. Y. Yu, M. Crucianu, V. Oria, and L. Chen. Local summarization and multi-level LSH for retrieving multi-variant audio tracks. In ACM Multimedia, pages 341-350, 2009.
32. Z. Zou, J. Li, H. Gao, and S. Zhang. Finding top-k maximal cliques in an uncertain graph. In ICDE, pages 625-636, 2010.