Finding the k-most abnormal subgraphs from a single graph

Jianbin Wang, Bin Hui Chou, Einoshin Suzuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationDiscovery Science - 12th International Conference, DS 2009, Proceedings
Pages441-448
Number of pages8
Volume5808 LNAI
DOIs
Publication statusPublished - Nov 16 2009
Event12th International Conference on Discovery Science, DS 2009 - Porto, Portugal
Duration: Oct 3 2009Oct 5 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5808 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Discovery Science, DS 2009
Country/TerritoryPortugal
CityPorto
Period10/3/0910/5/09

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Finding the k-most abnormal subgraphs from a single graph'. Together they form a unique fingerprint.

Cite this