2009 | OriginalPaper | Buchkapitel
Finding the k-Most Abnormal Subgraphs from a Single Graph
verfasst von : JianBin Wang, Bin-Hui Chou, Einoshin Suzuki
Erschienen in: Discovery Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.