AntNetAlign: Ant Colony Optimization for Network Alignment[Formula presented]

被引:6
|
作者
Rodríguez Corominas G. [1 ]
Blesa M.J. [2 ]
Blum C. [1 ]
机构
[1] Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra
[2] Universitat Politècnica de Catalunya (UPC - BarcelonaTech), Barcelona
来源
Applied Soft Computing | 2023年 / 132卷
关键词
Ant colony optimization; Combinatorial optimization; Graph theory; Network alignment;
D O I
10.1016/j.asoc.2022.109832
中图分类号
学科分类号
摘要
Network Alignment (NA) is a hard optimization problem with important applications such as, for example, the identification of orthologous relationships between different proteins and of phylogenetic relationships between species. Given two (or more) networks, the goal is to find an alignment between them, that is, a mapping between their respective nodes such that the topological and functional structure is well preserved. Although the problem has received great interest in recent years, there is still a need to unify the different trends that have emerged from diverse research areas. In this paper, we introduce ANTNETALIGN, an Ant Colony Optimization (ACO) approach for solving the problem. The proposed approach makes use of similarity information extracted from the input networks to guide the construction process. Combined with an improvement measure that depends on the current construction state, it is able to optimize any of the three main topological quality measures. We provide an extensive experimental evaluation using real-world instances that range from Protein–Protein Interaction (PPI) networks to Social Networks. Results show that our method outperforms other state-of-the-art approaches in two out of three of the tested scores within a reasonable amount of time, specially in the important S3 score. Moreover, it is able to obtain near-optimal results when aligning networks with themselves. Furthermore, in larger instances, our algorithm was still able to compete with the best performing method in this regard. © 2022 The Author(s)
引用
收藏
相关论文
共 50 条
  • [1] Negative Learning Ant Colony Optimization for Network Alignment
    Rodriguez Corominas, Guillem
    Blum, Christian
    Blesa, Maria J.
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'22), 2022, : 278 - 286
  • [2] AntNetAlign-A software package for Network Alignment
    Rodriguez Corominas, Guillem
    Blesa, Maria J.
    Blum, Christian
    SOFTWARE IMPACTS, 2023, 15
  • [3] Ant Colony Optimization for Random Network
    Bannapure, Mamta
    Patil, Vinayak L.
    2014 IEEE GLOBAL CONFERENCE ON WIRELESS COMPUTING AND NETWORKING (GCWCN), 2014, : 41 - 46
  • [4] Ant Colony Optimization for Neural Network
    Mei, H.
    Wang, Y.
    MANUFACTURING AUTOMATION TECHNOLOGY, 2009, 392-394 : 677 - 681
  • [5] Alignment Image Optimization Based on Ant Colony Algorithm
    Zeng Peiying
    Zhu Baoqiang
    Zhu Jianqiang
    LASER & OPTOELECTRONICS PROGRESS, 2022, 59 (10)
  • [6] Ant colony optimization method for multiple sequence alignment
    Chen, Ling
    Liu, Wei
    Chen, Juan
    PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 914 - 919
  • [7] Network Formation Using Ant Colony Optimization
    Oimoen, Steven C.
    Peterson, Gilbert L.
    Hopkinson, Kenneth M.
    ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2008, 5217 : 405 - 406
  • [8] Network Optimization Using Ant Colony Algorithm
    Munge, Mamta
    Shubhangi, Handore
    2016 INTERNATIONAL CONFERENCE ON AUTOMATIC CONTROL AND DYNAMIC OPTIMIZATION TECHNIQUES (ICACDOT), 2016, : 952 - 954
  • [9] An Efficient Ant Colony Optimization Algorithm for Multiple Graph Alignment
    Tran Ngoc Ha
    Do Duc Dong
    Hoang Xuan Huan
    2013 INTERNATIONAL CONFERENCE ON COMPUTING, MANAGEMENT AND TELECOMMUNICATIONS (COMMANTEL), 2013, : 386 - 391
  • [10] Horizontal directional drilling (HDD) alignment optimization using ant colony optimization
    Patino-Ramirez, Fernando
    Layhee, Carrie
    Arson, Chloe
    TUNNELLING AND UNDERGROUND SPACE TECHNOLOGY, 2020, 103