Published Articles >> Table of Contents >> Abstract

Third IEEE International Conference on Data Mining (ICDM'03)   p. 35
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
Mukund Deshpande, University of Minnesota, Minneapolis
Michihiro Kuramochi, University of Minnesota, Minneapolis
George Karypis, University of Minnesota, Minneapolis

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1250900
Send link to a friend

Abstract
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery process from the classification model construction and uses frequent subgraph discovery algorithms to find all topological and geometric sub-structures present in the dataset. The advantage of our approach is that during classification model construction, all relevant sub-structures are available allowing the classifier to intelligently select the most discriminating ones. The computational scalability is ensured by the use of highly efficient frequent subgraph discovery algorithms coupled with aggressive feature selection. Our experimental evaluation on eight different classification problems shows that our approach is computationally scalable and on the average, outperforms existing schemes by 10% to 35%.
Back to Top Additional Information
Citation:  Mukund Deshpande, Michihiro Kuramochi, George Karypis, "Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds," icdm, p. 35,  Third IEEE International Conference on Data Mining (ICDM'03),  2003