Classifying Molecules Using a Sparse Probabilistic Kernel Binary Classifier
- 8 July 2011
- journal article
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 51 (7) , 1539-1544
Abstract
The central idea of supervised classification in chemoinformatics is to design a classifying algorithm that accurately assigns a new molecule to one of a set of predefined classes. Tipping has devised a classifying scheme, the Relevance Vector Machine (RVM), which is in terms of sparsity equivalent to the Support Vector Machine (SVM). However, unlike SVM classifiers, the RVM classifiers are probabilistic in nature, which is crucial in the field of decision making and risk taking. In this work, we investigate the performance of RVM binary classifiers on classifying a subset of the MDDR data set, a standard molecular benchmark data set, into active and inactive compounds. Additionally, we present results that compare the performance of SVM and RVM binary classifiers.Keywords
This publication has 16 references indexed in Scilit:
- Classifying Large Chemical Data Sets: Using A Regularized Potential Function MethodJournal of Chemical Information and Modeling, 2010
- How To Winnow Actives from Inactives: Introducing Molecular Orthogonal Sparse Bigrams (MOSBs) and Multiclass WinnowJournal of Chemical Information and Modeling, 2008
- Virtual Screening Using Binary Kernel Discrimination: Effect of Noisy Training Data and the Optimization of PerformanceJournal of Chemical Information and Modeling, 2006
- Virtual Screening Using Binary Kernel Discrimination: Analysis of Pesticide DataJournal of Chemical Information and Modeling, 2006
- Comparison of topological descriptors for similarity-based virtual screening using multiple bioactive reference structuresOrganic & Biomolecular Chemistry, 2004
- Molecular Similarity Searching Using Atom Environments, Information-Based Feature Selection, and a Naïve Bayesian ClassifierJournal of Chemical Information and Computer Sciences, 2003
- Prediction of Biological Activity for High-Throughput Screening Using Binary Kernel DiscriminationJournal of Chemical Information and Computer Sciences, 2001
- A Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for the Training-Test SplitNeural Computation, 1997
- Multivariate binary discrimination by the kernel methodBiometrika, 1976
- On Estimation of a Probability Density Function and ModeThe Annals of Mathematical Statistics, 1962