PICS: Parameter-free identification of cohesive subgroups in large attributed graphs

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 439-450

  Akoglu, Leman ^a   Tong, Hanghang ^b   Meeder, Brendan ^a   Faloutsos, Christos ^a  

^a Carnegie Mellon University ^*  (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA MINING; GENE EXPRESSION; PARAMETER ESTIMATION; SPACE DIVISION MULTIPLE ACCESS; STATISTICS;

CONNECTIVITY STRUCTURES; CUSTOMER DEMOGRAPHICS; GENE INTERACTION NETWORKS; GRAPH CLUSTERING ALGORITHMS; NUMBER OF CLUSTERS; PARAMETER-FREE METHODS; SIMILARITY FUNCTIONS; USER-DEFINED PARAMETERS;

GRAPH THEORY;

EID: 84880243365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.38     Document Type: Conference Paper

References (30)

1. L. Adamic and N. Glance. The political blogosphere and the 2004 u.s. election: Divided they blog. In LinkKDD, pages 36-43, 2005.
2. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, pages 475-486, 2006.
3. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is \nearest neighbor" meaningful? In ICDT, pages 217-235, 1999.
4. D. Chakrabarti. Autopart: Parameter-free graph partitioning and outlier detection. In PKDD, 2004.
5. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD, pages 79-88, 2004.
6. P. K. Chan, M. D. F. Schlag, and J. Y. Zien. Spectral k-way ratio-cut partitioning and clustering. In DAC, pages 749-754, 1993.
7. I. Dhillon, S. Mallela, and D. Modha. Informationtheoretic co-clustering. In KDD, 2003.
8. C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon. A min-max cut algorithm for graph partitioning and data clustering. In ICDM, 2001.
9. N. Eagle, A. Pentland, and D. Lazer. Inferring social network structure using mobile phone data. PNAS, 2007.
10. G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In KDD. 2000.
11. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proc. of Nat. Acad. of Sci., 99(12):7821-7826, 2002.
12. P. D. Grunwald. The Minimum Description Length Principle. MIT Press, 2007.
13. S. Gunnemann, I. Farber, B. Boden, and T. Seidl. Subspace clustering meets dense subgraph mining: A synthesis of two paradigms. In ICDM, 2010.
14. D. Hanisch, A. Zien, R. Zimmer, and T. Lengauer. Coclustering of biological networks and gene expression data. In ISMB, pages 145-154, 2002.
15. J. He, H. Tong, S. Papadimitriou, T. Eliassi-Rad, C. Faloutsos, and J. Carbonell. Pack: Scalable parameter-free clustering on k-partite graphs. In SDM Work. on Link Anal., Cntr.terror. and Secur., 2009.
16. D. S. Johnson, S. Krishnan, J. Chhugani, S. Kumar, and S. Venkatasubramanian. Compressing large boolean matrices using reordering techniques. In VLDB, pages 13-23, 2004.
17. G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph partitioning. In Proc. of Supercomputing, pages 1-13, 1998.
18. H.-P. Kriegel, P. Kroger, and A. Zimek. Clustering high-dimensional data: A survey. ACM TKDD, 3(1):1-58, 2009.
19. B. Long, Z. Zhang, X. Wu, and P. S. Yu. Spectral clustering for multi-type relational data. In ICML, volume 148, pages 585-592, 2006.
20. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC, 2007.
21. F. Moser, R. Colak, A. Raey, and M. Ester. Mining cohesive patterns from graphs with feature vectors. In SDM, pages 593-604, 2009.
22. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, 2001.
23. J. Rissanen. A universal prior for integers and estimation by minimum description length. The Annals of Statistics, 11(2):416-431, 1983.
24. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22(8):888-905, 2000.
25. J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu. Graphscope: parameter-free mining of large timeevolving graphs. In KDD, pages 687-696, 2007.
26. Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In SIGMOD, pages 567-580, 2008.
27. http://www-personal.umich.edu/~mejn/netdata/Book citations on U.S. politics.
28. M. van Leeuwen, J. Vreeken, and A. Siebes. Identifying the components. In ECML/PKDD, 2009.
29. Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. PVLDB, 2(1):718-729, 2009.
30. Y. Zhou, H. Cheng, and J. X. Yu. Clustering large attributed graphs: An efficient incremental approach. In ICDM, pages 689-698, 2010.