期刊文献+

多粒度PPI网络描述模型及其蚁群优化的功能模块检测方法 被引量:1

A multiple grain representation model of PPI networks and its ant colony optimization method for functional module detection
下载PDF
导出
摘要 针对蚁群算法在大规模蛋白质相互作用(protein-protein interaction,PPI)网络中进行功能模块检测所暴露的时间性能方面的不足,提出了一种基于多粒度描述和蚁群优化的快速求解算法。首先,从粒度计算的角度,给出了一种新的多粒度PPI网络描述模型;然后,基于该模型,设计了融合功能和结构信息的粒度划分,粗粒度的蚁群寻优,解的还原与优化3个阶段的求解过程。在大规模PPI网络上的实验表明:算法在保证检测质量的同时,能显著降低利用蚁群算法进行功能模块检测的求解时间,而且与近年来的一些经典算法相比在检测精度上也具有一定的优势。 The time performance of ant colony optimization (ACO)algorithm is unqualified to detect functional modules in large scale PPI networks.A fast approach based on multiple grain representation and ant colony optimization is proposed.Firstly,a novel multiple grain representation model of PPI networks is proposed from the perspective of granular computing.A new algo-rithm is designed,containing three phases:a granularity partition process integrating functional and topological message,an ACO process on the coarse grain network,and a refinement and optimization process for solutions,is presented.In the experiments for large scale PPI networks,compared with some latest classical algorithms,the proposed algorithm greatly improve the speed of the algorithm using ACO to detect functional modules and presents competitive detection quality.
出处 《中国科技论文》 CAS 北大核心 2014年第7期762-769,共8页 China Sciencepaper
基金 高等学校博士学科点专项科研基金资助项目(20121103110031)
关键词 蛋白质相互作用网络 功能模块检测 多粒度描述模型 蚁群优化 protein-protein interaction network functional module detection multiple grain model ACO algorithm
  • 相关文献

参考文献20

  • 1Ji Junzhong, Zhang Aidong, I.iu Chunnian. et al. Sur- vey: Functional module detection from protein-protein interaction networks [J]. IEEE Transactions on Knowledge and Data Engineering, 2014, 26 ( 2 ): 261-277.
  • 2冀俊忠,刘志军,刘红欣,刘椿年.蛋白质相互作用网络功能模块检测的研究综述[J].自动化学报,2014,40(4):577-593. 被引量:23
  • 3Ji Junzhong, Liu Zhijun, Zhang Aidong, et al. HAM-FMD: mining functional modules in protein - protein interaction networks using ant colony optimization and multi-agent evolution [J]. Neurocomputing, 2013, 121 : 453-469.
  • 4Van D S. A cluster algorithm for graphs [J]. Report Information Systems, 2000(10) : 1-40. .
  • 5Bader G D, Hogue C W. An automated method for finding molecular complexes in large protein interaction networks [J]. BMC Bioinformatics, 2003, 4: 2-59.
  • 6Adamcsek B, Palla G, Farkas I J, et al. CFinder: Lo- cating cliques and overlapping modules in biological net- works [J]. Bioinformatics, 2006, 22(8): 1021-1023.
  • 7Palla G, Derenyi I, Farkas I, et al. Uncovering the o- verlapping community structure of complex networks in nature and society [J]. Nature, 2005, 435(7043) : 814- 818.
  • 8Altaf-U1-Amin M, Shinbo Y, Mihara K, et al. Devel- opment and implementation of an algorithm for detection of protein complexes in large interaction networks [J]. BMC Bioinformatics, 2006, 7: 207.
  • 9Aldecoa R, Marin I. Jerarca.. Efficient analysis of com- plex networks using hierarchical clustering [J]. PLOS ONE, 2010, 5(7): article No. e11585.
  • 10Sallim J, Abdullah R, Khader A T, ACOPIN.. An ACO algorithm with TSP approach for clustering pro- teins from protein interaction network [C]//2nd UK- SIM European Symposium on Computer Modeling and Simulation. Liverpool, England, 2008., 203-208.

二级参考文献25

  • 1Dorigo M, Maniezzo V, Colorni A. The ant system: Optimization by a colony of cooperating agents[J]. IEEE Trans on Systems, Man, and Cybernetics, Part B, 1996, 26 (1): 29-41.
  • 2Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonies [C] // Proc of the lnt Conf on Evolutionary Computation. Piscataway, NJ: IEEE, 1996:622-627.
  • 3Blum C, Dorigo M. Search bias in ant colony optimization: On the role of competition-balanced systems [J]. IEEE Trans on Evolutionary Computation, 2005, 9(2) : 159-174.
  • 4Blum C, Dorigo M. The hyper-cube framework for ant colony optimization [J]. IEEE Trans on Systems, Man, and Cybernetics, 2004, 34(2) : 1161-1172.
  • 5Dorigo M, Birattari M, Stutzle T. Ant colony optimization Artificial ants as a computational intelligence technique [J]. IEEE Computational Intelligence Magazine, 2006, 1 ( 11 ) :28-39.
  • 6Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the traveling salesman problem [J]. IEEE Trans on Evolutionary Computation, 1997, 1(1): 53-66.
  • 7Stutzle T, Hoos H H. MAX-MIN ant system [J]. Future Generation Computer System, 2000, 16(8): 889-914.
  • 8Reimann M. Guiding ACO by problem relaxation: A case study on the symmetric TSP [G] //LNCS4771. Berlin, Springer, 2007:45-56.
  • 9Le Louarn F X, Gendreau M, Potvin J Y. GENI ants for the travelling salesman problem [J]. Annals of Operations Research, 2004, 131(10): 187-201.
  • 10Easter M, Kriegel H P, Sander J, et al. A density-based algorithm for discovering clusters in large spatial databases with noise [ C ]// Proc of the Int Conf on Knowledge Discovery and Data Mining (KDD-96). Menlo Park, CA: AAAI, 1996: 226-231.

共引文献40

同被引文献10

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部