Please use this identifier to cite or link to this item:
Title: A graph mining algorithm for classifying chemical compounds
Authors: Lam, WWM
Chan, KCC 
Keywords: Graph mining
Chemical compounds
Frequent occuring sub-graphs
Interestingness measure
Weight of evidence
Issue Date: 2008
Publisher: IEEE
Source: IEEE International Conference on Bioinformatics and Biomedicine, 2008 : BIBM '08, 3-5 November 2008, Philadelphia, PA, p. 321-324 How to cite?
Abstract: Graph data mining algorithms are increasingly applied to biological graph dataset. However, while existing graph mining algorithms can identify frequently occurring sub-graphs, these do not necessarily represent useful patterns. In this paper, we propose a novel graph mining algorithm, MIGDAC (Mining Graph DAta for Classification), that applies graph theory and an interestingness measure to discover interesting sub-graphs which can be both characterized and easily distinguished from other classes. Applying MIGDAC to the discovery of specific patterns of chemical compounds, we first represent each chemical compound as a graph and transform it into a set of hierarchical graphs. This not only represents more information that traditional formats, it also simplifies the complex graph structures. We then apply MIGDAC to extract a set of class-specific patterns defined in terms of an interestingness threshold and measure with residue analysis. The next step is to use weight of evidence to estimate whether the identified class-specific pattern will positively or negatively characterize a class of drug. Experiments on a drug dataset from the KEGG ligand database show that MIGDAC using hierarchical graph representation greatly improves the accuracy of the traditional frequent graph mining algorithms.
ISBN: 978-0-7695-3452-7
DOI: 10.1109/BIBM.2008.36
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 31, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 14, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.