计算机科学
稳健性(进化)
聚类分析
星团(航天器)
水准点(测量)
二进制数
理论计算机科学
数据挖掘
算法
人工智能
数学
生物
计算机网络
地理
生物化学
算术
大地测量学
基因
标识
DOI:10.1007/978-3-642-37401-2_13
摘要
Cluster analysis is one of most important challenges for data mining in the modern Biology. The advance of experimental technologies have produced large amount of binary protein-protein interaction data, but it is hard to find protein complexes in vitro.We introduce new algorithm called B3Clustering which detects densely connected subgraphs from the complicated and noisy graph. B3Clustering finds clusters by adjusting the density of subgraphs to be flexible according to its size, because the more vertices the cluster has, the less dense it becomes. B3Clustering bisects the paths with distance of 3 into two groups to select vertices from each group.We experiment B3Clustering and two other clustering methods in three different PPI networks. Then, we compare the resultant clusters from each method with benchmark complexes called CYC2008. The experimental result supports the efficiency and robustness of B3Clustering for protein complex prediction in PPI networks.
科研通智能强力驱动
Strongly Powered by AbleSci AI