Ranking outlier nodes in subspaces of attributed graphs

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2013, Pages 216-222

  Muller, Emmanuel ^a,b   Sanchez, Patricia Iglesias ^a   Mulle, Yvonne ^a   Bohm, Klemens ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTED GRAPHS; BINARY DETECTION; DATA MINING TASKS; GRAPH STRUCTURES; MULTI DIMENSIONAL; OUTLIER ANALYSIS; RANKING TECHNIQUE; SUSPICIOUS OBJECTS;

TECHNICAL PRESENTATIONS;

STATISTICS;

EID: 84881447667     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2013.6547453     Document Type: Conference Paper

References (32)

1. P. Rousseeuw and A. Leroy, Robust Regression and Outlier Detection. Wiley, 1987.
2. E. Knorr and R. Ng, "Algorithms for Mining Distance-Based Outliers in Large Datasets," in VLDB, 1998, pp. 392-403.
3. V. Chandola, A. Banerjee, and V. Kumar, "Anomaly detection: A survey," ACM Comput. Surv., vol. 41, no. 3, 2009.
4. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos, "Relevance search and anomaly detection in bipartite graphs," SIGKDD Explorations, vol. 7, no. 2, pp. 48-55, 2005.
5. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is nearest neighbors meaningful," in IDBT, 1999, pp. 217-235.
6. M. Breunig, H. Kriegel, R. Ng, J. Sander et al., "LOF: identifying density-based local outliers," Sigmod Record, vol. 29, no. 2, pp. 93-104, 2000.
7. S. Papadimitriou, H. Kitagawa, P. Gibbons, and C. Faloutsos, "LOCI: Fast outlier detection using the local correlation integral," in ICDE, 2003, pp. 315-326.
8. C. Aggarwal and P. Yu, "Outlier detection for high dimensional data," ACM Sigmod Record, 2001.
9. A. Lazarevic and V. Kumar, "Feature bagging for outlier detection," in KDD, 2005, pp. 157-166.
10. E. Muller, I. Assent, U. Steinhausen, and T. Seidl, "Outrank: Ranking outliers in high dimensional data," in DBRank Workshop, 2008, pp. 600-603.
11. H.-P. Kriegel, P. Kroger, E. Schubert, and A. Zimek, "Outlier detection in axis-parallel subspaces of high dimensional data," in PAKDD, 2009, pp. 831-838.
12. E. Muller, M. Schiffer, and T. Seidl, "Statistical selection of relevant subspace projections for outlier ranking," in ICDE, 2011, pp. 434-445.
13. F. Keller, E. Muller, and K. Bohm, "HiCS: High contrast subspaces for density-based outlier ranking," in ICDE, 2012.
14. E. Muller, I. Assent, P. Iglesias, Y. Mulle, and K. Bohm, "Outlier ranking via subspace analysis in multiple views of the data," in ICDM, 2012.
15. D. Chakrabarti, "Autopart: Parameter-free graph partitioning and outlier detection," in PKDD, 2004, pp. 112-124.
16. C. C. Noble and D. J. Cook, "Graph-based anomaly detection," in KDD, 2003, pp. 631-636.
17. W. Eberle and L. B. Holder, "Discovering structural anomalies in graphbased data," in ICDM Workshops, 2007, pp. 393-398.
18. L. Akoglu, M. McGlohon, and C. Faloutsos, "oddball: Spotting anomalies in weighted graphs," in PAKDD, 2010, pp. 410-421.
19. X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger, "Scan: a structural clustering algorithm for networks," in KDD, 2007, pp. 824-833.
20. Y. Zhou, H. Cheng, and J. X. Yu, "Graph clustering based on structural/attribute similarities," PVLDB, vol. 2, no. 1, pp. 718-729, 2009.
21. F. Moser, R. Colak, A. Rafiey, and M. Ester, "Mining cohesive patterns from graphs with feature vectors," in SDM, 2009, pp. 593-604.
22. S. Gunnemann, I. Farber, B. Boden, and T. Seidl, "Subspace clustering meets dense subgraph mining: A synthesis of two paradigms," in ICDM, 2010, pp. 845-850.
23. L. Akoglu, H. Tong, B. Meeder, and C. Faloutsos, "Pics: Parameter-free identification of cohesive subgroups in large attributedgraphs," in SDM, 2012.
24. 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, 2010, pp. 813-822.
25. E. Muller, S. Gunnemann, I. Assent, and T. Seidl, "Evaluating clustering in subspace projections of high dimensional data," PVLDB, vol. 2, no. 1, pp. 1270-1281, 2009.
26. H.-P. Kriegel, P. Kroger, and A. Zimek, "Clustering High-Dimensional Data: A Survey on Subspace Clustering, Pattern-Based Clustering, and Correlation Clustering," TKDD, vol. 3, no. 1, pp. 1-58, 2009.
27. K. Sim, V. Gopalkrishnan, A. Zimek, and G. Cong, "A Survey on Enhanced Subspace Clustering," DMKD, 2012.
28. H. Tong, B. A. Prakash, C. E. Tsourakakis, T. Eliassi-Rad, C. Faloutsos, and D. H. Chau, "On the vulnerability of large graphs," in ICDM, 2010, pp. 1091-1096.
29. J. Leskovec, L. Adamic, and B. Huberman, "The dynamics of viral marketing," ACM Transactions on the Web (TWEB), vol. 1, no. 1, p. 5, 2007.
30. V. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, p. P10008, 2008.
31. Z. Zeng, J. Wang, L. Zhou, and G. Karypis, "Coherent closed quasiclique discovery from large dense graph databases," in KDD, 2006, pp. 797-802.
32. E. Muller, S. Gunnemann, I. Farber, and T. Seidl, "Discovering multiple clustering solutions: Grouping objects in different views of the data," in ICDM, 2010, p. 1220.