Title :
Using similarity learning to improve network-based gene function prediction
Author :
Ngo Phuong Nhung ; Tu Minh Phuong
Author_Institution :
KRDB Res. Center, Free Univ. of Bolzano, Bolzano, Italy
Abstract :
A common strategy for predicting gene function from heterogeneous data sources is to construct a combined functional association network and use this network to infer gene function. In such approaches, the prediction accuracy largely depends on the quality of the network, and network optimization steps can lead to more accurate results. Existing methods, however, construct combined networks, which are then fixed, and no further optimization steps are performed. We propose a method that improves functional association networks before using them to predict gene function. The method uses an online learning algorithm to learn a similarity measure between pairs of genes, then uses this measure to construct new networks. The learning algorithm can handle noisy training signals and is fast enough to be practical. We evaluated the proposed method in predicting gene functions in two species (yeast and human). We found that our method produced networks with improved prediction accuracy, and outperformed two other state-of-the-art gene function prediction methods. A Matlab implementation of the method is available upon request.
Keywords :
biology computing; distributed databases; genetics; learning (artificial intelligence); optimisation; proteins; Matlab implementation; combined functional association network; heterogeneous data sources; improved prediction accuracy; network optimization steps; network-based gene function prediction; noisy training signals; online learning algorithm; predicting gene functions; state-of-the-art gene function prediction methods; Accuracy; Classification algorithms; Humans; Prediction algorithms; Proteins; Semantics; Training; gene function prediction; similarity learning;
Conference_Titel :
Bioinformatics and Biomedicine (BIBM), 2012 IEEE International Conference on
Conference_Location :
Philadelphia, PA
Print_ISBN :
978-1-4673-2559-2
Electronic_ISBN :
978-1-4673-2558-5
DOI :
10.1109/BIBM.2012.6392663