Please use this identifier to cite or link to this item: https://doi.org/10.1186/1752-0509-6-S2-S13
Title: Supervised maximum-likelihood weighting of composite protein networks for complex prediction
Authors: Yong, C.H.
Liu, G. 
Chua, H.N.
Wong, L. 
Issue Date: 12-Dec-2012
Citation: Yong, C.H., Liu, G., Chua, H.N., Wong, L. (2012-12-12). Supervised maximum-likelihood weighting of composite protein networks for complex prediction. BMC Systems Biology 6 (SUPPL.2) : -. ScholarBank@NUS Repository. https://doi.org/10.1186/1752-0509-6-S2-S13
Abstract: Background: Protein complexes participate in many important cellular functions, so finding the set of existent complexes is essential for understanding the organization and regulation of processes in the cell. With the availability of large amounts of high-throughput protein-protein interaction (PPI) data, many algorithms have been proposed to discover protein complexes from PPI networks. However, such approaches are hindered by the high rate of noise in high-throughput PPI data, including spurious and missing interactions. Furthermore, many transient interactions are detected between proteins that are not from the same complex, while not all proteins from the same complex may actually interact. As a result, predicted complexes often do not match true complexes well, and many true complexes go undetected.Results: We address these challenges by integrating PPI data with other heterogeneous data sources to construct a composite protein network, and using a supervised maximum-likelihood approach to weight each edge based on its posterior probability of belonging to a complex. We then use six different clustering algorithms, and an aggregative clustering strategy, to discover complexes in the weighted network. We test our method on Saccharomyces cerevisiae and Homo sapiens, and show that complex discovery is improved: compared to previously proposed supervised and unsupervised weighting approaches, our method recalls more known complexes, achieves higher precision at all recall levels, and generates novel complexes of greater functional similarity. Furthermore, our maximum-likelihood approach allows learned parameters to be used to visualize and evaluate the evidence of novel predictions, aiding human judgment of their credibility.Conclusions: Our approach integrates multiple data sources with supervised learning to create a weighted composite protein network, and uses six clustering algorithms with an aggregative clustering strategy to discover novel complexes. We show improved performance over previous approaches in terms of precision, recall, and number and quality of novel predictions. We present and visualize two novel predicted complexes in yeast and human, and find external evidence supporting these predictions. © 2012 Yong et al.; licensee BioMed Central Ltd.
Source Title: BMC Systems Biology
URI: http://scholarbank.nus.edu.sg/handle/10635/77928
ISSN: 17520509
DOI: 10.1186/1752-0509-6-S2-S13
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
2012-supervised_maximum_likelihood-published.pdf6.38 MBAdobe PDF

OPEN

PublishedView/Download

SCOPUSTM   
Citations

16
checked on Sep 22, 2018

WEB OF SCIENCETM
Citations

10
checked on Sep 12, 2018

Page view(s)

42
checked on Aug 3, 2018

Download(s)

5
checked on Aug 3, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.