Focused clustering and outlier detection in large attributed graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2014, Pages 1346-1355

  Perozzi, Bryan ^a   Akoglu, Leman ^a   Iglesias Sánchez, Patricia ^b   Müller, Emmanuel ^c  

^a Stony Brook University   (United States)

^b KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

attributed graphs; clustering; distance metric learning; focused graph mining; infer user preference; outlier mining

Indexed keywords

EID: 84907031417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623682     Document Type: Conference Paper

References (34)

1. L. Akoglu, M. McGlohon, and C. Faloutsos. OddBall: Spotting anomalies in weighted graphs. In PAKDD, 2010.
2. L. Akoglu, H. Tong, B. Meeder, and C. Faloutsos. PICS: Parameter-free identification of cohesive subgroups in large attributed graphs. In SIAM SDM, pages 439-450, 2012.
3. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, 2006.
4. A. Banerjee, S. Basu, and S. Merugu. Multi-way clustering on relation graphs. In SIAM SDM, 2007.
5. S. Basu, I. Davidson, and K. Wagstaff. Clustering with Constraints: Algorithms, Applications and Theory. 2008.
6. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, NY, USA, 2004.
7. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD, pages 79-88, 2004.
8. A. Clauset. Finding local community structure in networks. Physical Review E, 72(2):026132, 2005.
9. A. Condon and R. M. Karp. Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms, 18(2):116-140, 2001.
10. I. Dhillon, S. Mallela, and D. Modha. Information-theoretic co-clustering. In KDD, 2003.
11. 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.
12. G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In KDD. 2000.
13. J. Gao, H. Cheng, and P.-N. Tan. Semi-supervised outlier detection. In ACM Symp. on Appl. Comp., 2006.
14. J. Gao, F. Liang, W. Fan, C. Wang, Y. Sun, and J. Han. On community outliers and their efficient detection in information networks. In KDD, pages 813-822, 2010.
15. D. F. Gleich and C. Seshadhri. Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In KDD, pages 597-605, 2012.
16. S. Günnemann, I. Färber, B. Boden, and T. Seidl.Subspace clustering meets dense subgraph mining: A synthesis of two paradigms. In ICDM, 2010.
17. D. Hanisch, A. Zien, R. Zimmer, and T. Lengauer. Co-clustering of biological networks and gene expression data. In ISMB, pages 145-154, 2002.
18. P. Iglesias, E. Müller, F. Laforet, F. Keller, and K. Böhm.Statistical selection of congruent subspaces for outlier detection on attributed graphs. In ICDM, 2013.
19. G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph partitioning. In Proc. of Supercomputing, pages 1-13, 1998.
20. B. Long, Z. Zhang, X. Wu, and P. S. Yu. Spectral clustering for multi-type relational data. In ICML, 2006.
21. C. D. Manning, P. Raghavan, and H. Schtze. Intro to Information Retrieval. Cambridge University Press, 2008.
22. F. Moser, R. Colak, A. Rafiey, and M. Ester. Mining cohesive patterns from graphs with feature vectors. In SDM, 2009.
23. E. Müller, P. I. Sanchez, Y. Mülle, and K. Böhm. Rankingoutlier nodes in subspaces of attributed graphs. In ICDE Workshops, pages 216-222, 2013.
24. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, 2001.
25. C. C. Noble and D. J. Cook. Graph-based anomaly detection. In KDD, pages 631-636, 2003.
26. J. Tang and H. Liu. Unsupervised feature selection for linked social media data. In KDD, pages 904-912, 2012.
27. Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In SIGMOD, 2008.
28. H. Tong and C.-Y. Lin. Non-negative residual matrix factorization with application to graph anomaly detection. In SIAM SDM, pages 143-153, 2011.
29. F. Wang and J. Sun. Distance metric learning in data mining. In SIAM SDM. Tutorials, 2012.
30. J. Whang, D. Gleich, and I. Dhillon. Overlapping community detection using seed set expansion. In CIKM, pages 2099-2108, 2013.
31. S. White and P. Smyth. A spectral clustering approach to finding communities in graph. In SDM, 2005.
32. E. P. Xing, A. Y. Ng, M. I. Jordan, and S. J. Russell. Distance metric learning with application to clustering with side-information. In NIPS, pages 505-512, 2002.
33. J. Yang and J. Leskovec. Overlapping community detection at scale: a nonnegative matrix factorization approach. In WSDM, pages 587-596, 2013.
34. Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. PVLDB, 2(1):718-729, 2009.