Abstract
The protein complexes have significant biological functions of proteins and nucleic acids dense from the molecular interaction network in cells. Several computational methods are developed to detect protein complexes from the protein–protein interaction (PPI) networks. The existing algorithms do not predict better complex, and it also provides low performance values. In this research, K-means algorithm has been proposed for protein complex detection and compared with the existing algorithms such as MCODE and SPICi. The protein interaction and gene expression benchmark datasets such as Collins, DIP, Krogan, Krogan Extended, PPI-D1, PPI-D2, GSE12220, GSE12221, GSE12442, and GSE17716 have been used for comparing the performance of the existing and proposed algorithms. From this experimental analysis, it is inferred that the proposed K-means clustering algorithm outperforms the other existing methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bader GD and Hogue CW. An Automated Method For Finding Molecular Complexes In Large Protein Interaction Networks. BMC Bioinformatics. 2003 Jan 13;4:2.
Tong AH, et al. A combined experimental and computational strategy to define protein interaction networks for peptide recognition modules. Science. 2002 Jan 11;295(5553):321–4.
Eileen Marie Hanna, et al. Detecting Protein Complexes In Protein Interaction Networks Modelled As Gene Expression Biclusters. PLoS One. 2015 Dec 7;10(12):e0144163.
Le Ou-Yang et al. Protein Complex Detection Based On Partially Shared Multi-View Clustering. BMC Bioinformatics. 2016 Sep 13;17(1):371.
Xueyong Li et al. Identification of protein complexes from multi-relationship protein interaction networks. Hum Genomics. 2016; 10(Suppl 2): 17.
Ou-Yang L, et al. A Two Layer Integration Framework For Protein Complex Detection. BMC Bioinformatics. 2016 Feb 24;17:100.
Altaf-Ul-Amin, M. et al. Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinformatics. 2006;7:207.
S. Brohee and J. van Helden. Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinformatics. 2006 Nov 6;7:488.
A.D. King, N. Przulj, and I. Jurisica. Protein complex prediction via cost-based clustering. Bioinformatics. 2004 Nov 22;20(17):3013–20.Â
Debomoy K Lahiri and Yuan-Wen Ge. Electrophoretic mobility shift assay for the detection of specific DNA–protein complex in nuclear extracts from the cultured cells and frozen autopsy human brain tissue. Brain Res Brain Res Protoc. 2000 Jul;5(3):257–65.
Jiang P and Singh M. SPICi: a fast clustering algorithm for large biological networks. Bioinformatics. 2010 Apr 15;26(8):1105–11.
Enright, A.J. et al. An efficient algorithm for large-scale detection of protein families. Nucleic Acids Res. 2002 Apr 1;30(7):1575–84.
Ashburner, M. et al. Gene Ontology: tool for the unification of biology. The Gene Ontology Consortium. Nat Genet. 2000 May;25(1):25–9.
Tapas Kanungo and David M. Mount. An Efficient k-Means Clustering Algorithm: Analysis and Implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence. Vol. 24, No. 7, July 2002.
K. Alsabti, S. Ranka, and V. Singh, An Efficient k-means Clustering Algorithm, Proc. First Workshop High Performance Data Mining, Mar. 1998.
L. Kaufman and P.J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. New York: John Wiley & Sons, 1990.
O.L. Mangasarian.Mathematical Programming in Data Mining. Data Mining and Knowledge Discovery. vol. 1, pp. 183–201, 1997.
Acknowledgements
The authors thank the Department of Science and Technology (DST), New Delhi (DST/INSPIRE Fellowship/2015/IF150093), for the financial support under INSPIRE Fellowship for this research work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kalaivani, S., Ramyachitra, D., Manikandan, P. (2018). K-means Clustering: An Efficient Algorithm for Protein Complex Detection. In: Pattnaik, P., Rautaray, S., Das, H., Nayak, J. (eds) Progress in Computing, Analytics and Networking. Advances in Intelligent Systems and Computing, vol 710. Springer, Singapore. https://doi.org/10.1007/978-981-10-7871-2_43
Download citation
DOI: https://doi.org/10.1007/978-981-10-7871-2_43
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7870-5
Online ISBN: 978-981-10-7871-2
eBook Packages: EngineeringEngineering (R0)