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
CountryPortugal
CityPorto
Period10/3/0910/5/09

Fingerprint

Bioinformatics
Subgraph
Detectors
Graph in graph theory
Experiments
Dissimilarity
Detector
Experiment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Wang, J., Chou, B. H., & Suzuki, E. (2009). Finding the k-most abnormal subgraphs from a single graph. In Discovery Science - 12th International Conference, DS 2009, Proceedings (Vol. 5808 LNAI, pp. 441-448). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5808 LNAI). https://doi.org/10.1007/978-3-642-04747-3_37

Finding the k-most abnormal subgraphs from a single graph. / Wang, Jianbin; Chou, Bin Hui; Suzuki, Einoshin.

Discovery Science - 12th International Conference, DS 2009, Proceedings. Vol. 5808 LNAI 2009. p. 441-448 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5808 LNAI).

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

Wang, J, Chou, BH & Suzuki, E 2009, Finding the k-most abnormal subgraphs from a single graph. in Discovery Science - 12th International Conference, DS 2009, Proceedings. vol. 5808 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5808 LNAI, pp. 441-448, 12th International Conference on Discovery Science, DS 2009, Porto, Portugal, 10/3/09. https://doi.org/10.1007/978-3-642-04747-3_37
Wang J, Chou BH, Suzuki E. Finding the k-most abnormal subgraphs from a single graph. In Discovery Science - 12th International Conference, DS 2009, Proceedings. Vol. 5808 LNAI. 2009. p. 441-448. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-04747-3_37
Wang, Jianbin ; Chou, Bin Hui ; Suzuki, Einoshin. / Finding the k-most abnormal subgraphs from a single graph. Discovery Science - 12th International Conference, DS 2009, Proceedings. Vol. 5808 LNAI 2009. pp. 441-448 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ee6113eaf29740e38f9bcddd2faf8cee,
title = "Finding the k-most abnormal subgraphs from a single graph",
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.",
author = "Jianbin Wang and Chou, {Bin Hui} and Einoshin Suzuki",
year = "2009",
month = "11",
day = "16",
doi = "10.1007/978-3-642-04747-3_37",
language = "English",
isbn = "3642047467",
volume = "5808 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "441--448",
booktitle = "Discovery Science - 12th International Conference, DS 2009, Proceedings",

}

TY - GEN

T1 - Finding the k-most abnormal subgraphs from a single graph

AU - Wang, Jianbin

AU - Chou, Bin Hui

AU - Suzuki, Einoshin

PY - 2009/11/16

Y1 - 2009/11/16

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71049144964&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71049144964&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-04747-3_37

DO - 10.1007/978-3-642-04747-3_37

M3 - Conference contribution

AN - SCOPUS:71049144964

SN - 3642047467

SN - 9783642047466

VL - 5808 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 441

EP - 448

BT - Discovery Science - 12th International Conference, DS 2009, Proceedings

ER -