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
T2 - 12th International Conference on Discovery Science, DS 2009
Y2 - 3 October 2009 through 5 October 2009
ER -