Classifying Molecules Using a Sparse Probabilistic Kernel Binary Classifier

详细信息    查看全文

• 作者：Robert Lowe ; Hamse Y. Mussa ; John B. O. Mitchell ; Robert C. Glen
• 刊名：Journal of Chemical Information and Modeling
• 出版年：2011
• 出版时间：July 25, 2011
• 年：2011
• 卷：51
• 期：7
• 页码：1539-1544
• 全文大小：797K
• 年卷期：v.51,no.7(July 25, 2011)
• ISSN：1549-960X

文摘

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.