2009 | OriginalPaper | Chapter
Finding the k-Most Abnormal Subgraphs from a Single Graph
Authors : JianBin Wang, Bin-Hui Chou, Einoshin Suzuki
Published in: Discovery Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.