Identification of functional modules in dynamic weighted PPI networks by a novel clustering algorithm

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Density-Based Spatial Clustering of Application with Noise algorithm (DBSCAN) suffers the limitations of selecting global parameters and having the low accuracy in recognizing overlapping protein complexes. In order to overcome the disadvantage of slow convergence and being vulnerable to trap in local optima in Artificial Bee Colony algorithm (ABC), we designed a method with novel weights and distance calculated which is suitable for network topology and the interaction between proteins. Furthermore, a truncation-championship selection mechanism (TCSM) was proposed to avoid local optimum when onlooker bees search nectar source. Meanwhile, we present the adaptive step strategy (ASS) to improve the clustering speed in ABC algorithm. Finally, in order to overcome the shortcoming which is unable to identify protein complexes in the DBSCAN algorithm, a strategy is proposed to optimize the clustering result. The experimental results on superior precision and recall parameters demonstrate that our method has competitive performance for identifying protein complexes.

Cite

CITATION STYLE

APA

Mao, Y., Yu, X., & Zhu, H. (2019). Identification of functional modules in dynamic weighted PPI networks by a novel clustering algorithm. In Communications in Computer and Information Science (Vol. 1122 CCIS, pp. 461–472). Springer. https://doi.org/10.1007/978-981-15-1301-5_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free