Classifying molecules using a sparse probabilistic kernel binary classifier

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.     

Robustified least squares support vector classification

Support vector machine (SVM) algorithms are a popular class of techniques to perform classification. However, outliers in the data can result in bad global misclassification percentages. In this paper, we propose a method to identify such outliers in the SVM framework. A specific robust classification algorithm is proposed adjusting the least squares SVM (LS‐SVM). This yields better classification performance for heavily tailed data and data containing outliers. Copyright © 2009 John Wiley & Sons, Ltd.     

A novel method for human gender classification using Raman spectroscopy of fingernail clippings

This paper illustrates a novel method for human gender classification by measuring the Raman spectrum of fingernail clippings. As Raman spectroscopy reveals the characteristics of vibrational frequencies of the fingernails, it provides unique chemical fingerprints that can be used to describe the molecular structure differences of fingernail between males and females. As the differences of Raman spectra of human fingernails are very subtle, they are enhanced by using a pattern recognition method. In the present study, a combination algorithm of principal component analysis (PCA) and support vector machines (SVM) was implemented to perform the data classification. This combined algorithm provides a classification accuracy of up to 90%. The success of this present method may be used as an alternative rapid tool to identify human gender in forensic applications.     

基于支持向量机的药物诱导磷脂质病预测模型

本文应用一种组合遗传算法和共轭梯度法的支持向量机(GA-CG-SVM)方法建立了药物诱导磷脂质病分类预测模型.首先对描述符进行了优化,选出了19个描述符用于模型的构建,所建模型对训练集的预测准确率为81.6%,对测试集的预测精度为87.5%,说明所建SVM分类模型不仅能正确预测训练集药物诱导的磷脂质病,也对其他化合物具...     

支持向量机与KStar模型预测细胞色素P450酶催化的氧脱烃反应

分别以支持向量机(SVM)和KStar方法为基础, 构建了代谢产物的分子形状判别和代谢反应位点判别的嵌套预测模型. 分子形状判别模型是以272个分子为研究对象, 计算了包括分子拓扑、二维自相关、几何结构等在内的1280个分子描述符, 考查了支持向量机、决策树、贝叶斯网络、k最近邻这四种机器学习方法建立分类预测模型的准确性. 结果表明, 支持向量机优于其他方法, 此模型可用于预测分子能否被细胞色素P450酶催化发生氧脱烃反应. 代谢反应位点判别模型以538个氧脱烃反应代谢位点为研究对象, 计算了表征原子能量、价态、电荷等26个量子化学特征, 比较了决策树、贝叶斯网络、KStar、人工神经网络建模的准确率. 结果显示, KStar模型的准确率、敏感性、专一性均在90%以上, 对分子形状判别模型筛选出的分子, 此模型能较好地判断出哪个C―O键发生断裂. 本文以15个代谢反应明确的中药分子为验证集, 验证模型准确性, 研究结果表明基于SVM和KStar的嵌套预测模型具有一定的准确性, 有助于开展中药分子氧脱烃代谢产物的预测研究.     

基于三维分子描述符的埃坡霉素类衍生物抗癌活性预测

为预测埃坡霉素类衍生物的抗癌活性, 定义了一套表征分子形状的描述符, 即K阶形状参数, 并计算了67个表征分子的电子、拓扑和几何结构的分子描述符. 描述符经遗传算法筛选, 用于建立基于支持向量学习机(SVM)的抗癌活性分类模型; 用留一法和5重交叉验证法对SVM模型参数进行了优化. 结果表明模型具有较高的预测性且两种方法得到相近结果, 交叉验证的预测正确率达80.6%; 经筛选后的描述符有30个, 其中含有5个K阶形状参数, 这些描述符对埃坡霉素类衍生物的抗癌活性的模型建立具有比较重要的作用.     

Classifying large chemical data sets: using a regularized potential function method

In recent years classifiers generated with kernel-based methods, such as support vector machines (SVM), Gaussian processes (GP), regularization networks (RN), and binary kernel discrimination (BKD) have been very popular in chemoinformatics data analysis. Aizerman et al. were the first to introduce the notion of employing kernel-based classifiers in the area of pattern recognition. Their original scheme, which they termed the potential function method (PFM), can basically be viewed as a kernel-based perceptron procedure and arguably subsumes the modern kernel-based algorithms. PFM can be computationally much cheaper than modern kernel-based classifiers; furthermore, PFM is far simpler conceptually and easier to implement than the SVM, GP, and RN algorithms. Unfortunately, unlike, e.g., SVM, GP, and RN, PFM is not endowed with both theoretical guarantees and practical strategies to safeguard it against generating overfitting classifiers. This is, in our opinion, the reason why this simple and elegant method has not been taken up in chemoinformatics. In this paper we empirically address this drawback: while maintaining its simplicity, we demonstrate that PFM combined with a simple regularization scheme may yield binary classifiers that can be, in practice, as efficient as classifiers obtained by employing state-of-the-art kernel-based methods. Using a realistic classification example, the augmented PFM was used to generate binary classifiers. Using a large chemical data set, the generalization ability of PFM classifiers were then compared with the prediction power of Laplacian-modified naive Bayesian (LmNB), Winnow (WN), and SVM classifiers.     

Integrating subcellular location for improving machine learning models of remote homology detection in eukaryotic organisms

A significant challenge in homology detection is to identify sequences that share a common evolutionary ancestor, despite significant primary sequence divergence. Remote homologs will often have less than 30% sequence identity, yet still retain common structural and functional properties. We demonstrate a novel method for identifying remote homologs using a support vector machine (SVM) classifier trained by fusing sequence similarity scores and subcellular location prediction. SVMs have been shown to perform well in a variety of applications where binary classification of data is the goal. At the same time, data fusion methods have been shown to be highly effective in enhancing discriminative power of data. Combining these two approaches in the application SVM-SimLoc resulted in identification of significantly more remote homologs (p-value<0.006) than using either sequence similarity or subcellular location independently.     

Variable predictive model based classification algorithm for effective separation of protein structural classes

Variable predictive model based class discrimination (VPMCD) algorithm is proposed as an effective protein secondary structure classification tool. The algorithm mathematically represents the characteristics amino acid interactions specific to each protein structure and exploits them further to distinguish different structures. The new concept and the VPMCD classifier are established using well-studied datasets containing four protein classes as benchmark. The protein samples selected from SCOP and PDB databases with varying homology (25-100%) and non-uniform distribution of class samples provide challenging classification problem. The performance of the new method is compared with advanced classification algorithms like component coupled, SVM and neural networks. VPMCD provides superior performance for high homology datasets. 100% classification is achieved for self-consistency test and an improvement of 5% prediction accuracy is obtained during Jackknife test. The sensitivity of the new algorithm is investigated by varying model structures/types and sequence homology. Simpler to implement VPMCD algorithm is observed to be a robust classification technique and shows potential for effective extensions to other clinical diagnosis and data mining applications in biological systems.     

基于支持向量学习机方法的人体小肠吸收药物活性的预测

为了预测分子在人体小肠中的吸收,本文计算了表征分子的电子、拓扑、几何结构、分子形状等特征的102个分子描述符,用遗传算法变量选择方法使描述符减少到47个。体系共包含了230个化合物分子,69个不能被吸收(mA-),161个可以被吸收(HIA )。对建立的SVM模型,用5重交叉验证和独立测试集进行验证,预测正确率分别达到79．1％和77．1％,结果具有较好的一致性。在模型验证中,通过聚类分析方法组合训练集和测试集,保证了模型的稳定性,提高了建模效率。     

Genetic Bee Colony (GBC) algorithm: A new gene selection method for microarray cancer classification

Naturally inspired evolutionary algorithms prove effectiveness when used for solving feature selection and classification problems. Artificial Bee Colony (ABC) is a relatively new swarm intelligence method. In this paper, we propose a new hybrid gene selection method, namely Genetic Bee Colony (GBC) algorithm. The proposed algorithm combines the used of a Genetic Algorithm (GA) along with Artificial Bee Colony (ABC) algorithm. The goal is to integrate the advantages of both algorithms. The proposed algorithm is applied to a microarray gene expression profile in order to select the most predictive and informative genes for cancer classification. In order to test the accuracy performance of the proposed algorithm, extensive experiments were conducted. Three binary microarray datasets are use, which include: colon, leukemia, and lung. In addition, another three multi-class microarray datasets are used, which are: SRBCT, lymphoma, and leukemia. Results of the GBC algorithm are compared with our recently proposed technique: mRMR when combined with the Artificial Bee Colony algorithm (mRMR-ABC). We also compared the combination of mRMR with GA (mRMR-GA) and Particle Swarm Optimization (mRMR-PSO) algorithms. In addition, we compared the GBC algorithm with other related algorithms that have been recently published in the literature, using all benchmark datasets. The GBC algorithm shows superior performance as it achieved the highest classification accuracy along with the lowest average number of selected genes. This proves that the GBC algorithm is a promising approach for solving the gene selection problem in both binary and multi-class cancer classification.