Issue No.08 - August (2005 vol.17)
George Karypis , IEEE Computer Society
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.127
Computational techniques that build models to correctly assign chemical compounds to various classes of interest have many applications in pharmaceutical research and are used extensively at various phases during the drug development process. These techniques are used to solve a number of classification problems such as predicting whether or not a chemical compound has the desired biological activity, is toxic or nontoxic, and filtering out drug-like compounds from large compound libraries. This paper presents a substructure-based classification algorithm that decouples the substructure discovery process from the classification model construction and uses frequent subgraph discovery algorithms to find all topological and geometric substructures present in the data set. The advantage of this approach is that during classification model construction, all relevant substructures 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. Experimental evaluation on eight different classification problems shows that our approach is computationally scalable and, on average, outperforms existing schemes by 7 percent to 35 percent.
Index Terms- Classification, chemical compounds, virtual screening, graphs, SVM.
Mukund Deshpande, Michihiro Kuramochi, Nikil Wale, George Karypis, "Frequent Substructure-Based Approaches for Classifying Chemical Compounds", IEEE Transactions on Knowledge & Data Engineering, vol.17, no. 8, pp. 1036-1050, August 2005, doi:10.1109/TKDE.2005.127