joint clustering algorithm, protein protein interaction networks, markov random walk
Digital Object Identifier (DOI)
Biological networks obtained by high-throughput profiling or human curation are typically noisy. For functional module identification, single network clustering algorithms may not yield accurate and robust results. In order to borrow information across multiple sources to alleviate such problems due to data quality, we propose a new joint network clustering algorithm ASModel in this paper. We construct an integrated network to combine network topological information based on protein-protein interaction (PPI) datasets and homological information introduced by constituent similarity between proteins across networks. A novel random walk strategy on the integrated network is developed for joint network clustering and an optimization problem is formulated by searching for low conductance sets defined on the derived transition matrix of the random walk, which fuses both topology and homology information. The optimization problem of joint clustering is solved by a derived spectral clustering algorithm. Network clustering using several state-of-the-art algorithms has been implemented to both PPI networks within the same species (two yeast PPI networks and two human PPI networks) and those from different species (a yeast PPI network and a human PPI network). Experimental results demonstrate that ASModel outperforms the existing single network clustering algorithms as well as another recent joint clustering algorithm in terms of complex prediction and Gene Ontology (GO) enrichment analysis.
This work is licensed under a Creative Commons Attribution 3.0 License.
Was this content written or created while at USF?
Citation / Publisher Attribution
BMC Systems Biology, v. 8, Suppl. 1, art. S9
Scholar Commons Citation
Wang, Yijie and Qian, Xiaoning, "Joint Clustering of Protein Interaction Networks Through Markov Random Walk" (2014). Computer Science and Engineering Faculty Publications. 1.