Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
2003-03-10
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
Published Date
2003-03-10
Publisher
Type
Report
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 constructionand 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 ofhighly 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 outperforms existing schemes by 10% to 35%, on the average.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Deshpande, Mukund; Kuramochi, Michihiro; Karypis, George. (2003). Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215559.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.