Protein localization prediction using random walks on graphs

BMC Bioinformatics

Proceedings

Ping He¹  Xiaohua Xu¹  Lin Lu¹  Ling Chen¹ 

[1] Department of Computer Science, Yangzhou University, 225009, Yangzhou, China;

关键词: Support Vector Machine;    Random Walk;    Support Vector Machine Classifier;    Kernel Matrix;    Label Node;   

DOI  :  10.1186/1471-2105-14-S8-S4

来源: Springer

【 摘 要 】

BackgroundUnderstanding the localization of proteins in cells is vital to characterizing their functions and possible interactions. As a result, identifying the (sub)cellular compartment within which a protein is located becomes an important problem in protein classification. This classification issue thus involves predicting labels in a dataset with a limited number of labeled data points available. By utilizing a graph representation of protein data, random walk techniques have performed well in sequence classification and functional prediction; however, this method has not yet been applied to protein localization. Accordingly, we propose a novel classifier in the site prediction of proteins based on random walks on a graph.ResultsWe propose a graph theory model for predicting protein localization using data generated in yeast and gram-negative (Gneg) bacteria. We tested the performance of our classifier on the two datasets, optimizing the model training parameters by varying the laziness values and the number of steps taken during the random walk. Using 10-fold cross-validation, we achieved an accuracy of above 61% for yeast data and about 93% for gram-negative bacteria.ConclusionsThis study presents a new classifier derived from the random walk technique and applies this classifier to investigate the cellular localization of proteins. The prediction accuracy and additional validation demonstrate an improvement over previous methods, such as support vector machine (SVM)-based classifiers.

【 授权许可】

CC BY   
© Xu et al.; licensee BioMed Central Ltd. 2013