Finding the k-Most Abnormal Subgraphs from a Single Graph

Authors:
Jianbin Wang;Bin-Hui Chou;Einoshin Suzuki
Affiliations:
Department of Informatics, ISEE, Kyushu University, Fukuoka, Japan 819-0395;Department of Informatics, ISEE, Kyushu University, Fukuoka, Japan 819-0395;Department of Informatics, ISEE, Kyushu University, Fukuoka, Japan 819-0395
Venue:
DS '09 Proceedings of the 12th International Conference on Discovery Science
Year:
2009

Citing 10
Cited 1

Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Graph-based anomaly detection

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Central Clustering of Attributed Graphs

Machine Learning
Mining Graph Data

Mining Graph Data
AutoPart: parameter-free graph partitioning and outlier detection

PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Substructure similarity search in graph databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Relevance search and anomaly detection in bipartite graphs

ACM SIGKDD Explorations Newsletter
Finding the most unusual time series subsequence: algorithms and applications

Knowledge and Information Systems
Discovering Structural Anomalies in Graph-Based Data

ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Graph embedding in vector spaces by means of prototype selection

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition

SigSpot: mining significant anomalous regions from time-evolving networks (abstract only)

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a discord discovery method which finds the k -most dissimilar subgraphs of size n among the subgraphs of the same size of an input graph, where the values of k and n are given by the user. Our algorithm SD3 (Subgraph Discord Detector based on Dissimilarity) exploits a dynamic index structure and its effectiveness is demonstrated through experiments using graph data in chemical-informatics and bioinformatics.