A Method Based on Temporal Embedding for the Pairwise Alignment of Dynamic Networks

被引:9
|
作者
Cinaglia, Pietro [1 ]
Cannataro, Mario [2 ]
机构
[1] Magna Graecia Univ Catanzaro, Dept Hlth Sci, I-88100 Catanzaro, Italy
[2] Magna Graecia Univ Catanzaro, Data Analyt Res Ctr, Dept Med & Surg Sci, I-88100 Catanzaro, Italy
关键词
dynamic networks; temporal networks; network alignment; embeddings; temporal embedding; NODE;
D O I
10.3390/e25040665
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
In network analysis, real-world systems may be represented via graph models, where nodes and edges represent the set of biological objects (e.g., genes, proteins, molecules) and their interactions, respectively. This representative knowledge-graph model may also consider the dynamics involved in the evolution of the network (i.e., dynamic networks), in addition to a classic static representation (i.e., static networks). Bioinformatics solutions for network analysis allow knowledge extraction from the features related to a single network of interest or by comparing networks of different species. For instance, we may align a network related to a well known species to a more complex one in order to find a match able to support new hypotheses or studies. Therefore, the network alignment is crucial for transferring the knowledge between species, usually from simplest (e.g., rat) to more complex (e.g., human). Methods: In this paper, we present Dynamic Network Alignment based on Temporal Embedding (DANTE), a novel method for pairwise alignment of dynamic networks that applies the temporal embedding to investigate the topological similarities between the two input dynamic networks. The main idea of DANTE is to consider the evolution of interactions and the changes in network topology. Briefly, the proposed solution builds a similarity matrix by integrating the tensors computed via the embedding process and, subsequently, it aligns the pairs of nodes by performing its own iterative maximization function. Results: The performed experiments have reported promising results in terms of precision and accuracy, as well as good robustness as the number of nodes and time points increases. The proposed solution showed an optimal trade-off between sensitivity and specificity on the alignments produced on several noisy versions of the dynamic yeast network, by improving by similar to 18.8% (with a maximum of 20.6%) the Area Under the Receiver Operating Characteristic (ROC) Curve (i.e., AUC or AUROC), compared to two well known methods: DYNAMAGNA++ and DYNAWAVE. From the point of view of quality, DANTE outperformed these by similar to 91% as nodes increase and by similar to 75% as the number of time points increases. Furthermore, a similar to 23.73% improvement in terms of node correctness was reported with our solution on real dynamic networks.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] Twadn: an efficient alignment algorithm based on time warping for pairwise dynamic networks
    Zhong, Yuanke
    Li, Jing
    He, Junhao
    Gao, Yiqun
    Liu, Jie
    Wang, Jingru
    Shang, Xuequn
    Hu, Jialu
    BMC BIOINFORMATICS, 2020, 21 (Suppl 13)
  • [2] Twadn: an efficient alignment algorithm based on time warping for pairwise dynamic networks
    Yuanke Zhong
    Jing Li
    Junhao He
    Yiqun Gao
    Jie Liu
    Jingru Wang
    Xuequn Shang
    Jialu Hu
    BMC Bioinformatics, 21
  • [3] Dynamic Recurrent Embedding for Temporal Interaction Networks
    Liu, Qilin
    Zhu, Xiaobo
    Yuan, Changgan
    Wu, Hongje
    Zhao, Xinming
    INTELLIGENT COMPUTING METHODOLOGIES, PT III, 2022, 13395 : 615 - 625
  • [4] Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks
    Kumar, Srijan
    Zhang, Xikun
    Leskovec, Jure
    KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 1269 - 1278
  • [5] Cross-Temporal Snapshot Alignment for Dynamic Networks
    Liang, Shangsong
    Tang, Shaowei
    Meng, Zaiqiao
    Zhang, Qiang
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (03) : 2406 - 2420
  • [6] Pairwise alignment of protein interaction networks
    Koyutürk, M
    Kim, Y
    Topkara, U
    Subramaniam, S
    Szpankowski, W
    Grama, A
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2006, 13 (02) : 182 - 199
  • [7] DYNAMIC WEIGHT ALIGNMENT FOR TEMPORAL CONVOLUTIONAL NEURAL NETWORKS
    Iwana, Brian Kenji
    Uchida, Seiichi
    2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 3827 - 3831
  • [8] A Novel Method for Pairwise Alignment Based on an Ant Colony Algorithm
    Li, Gangcheng
    Zhou, Xinyuan
    Yang, Jie
    Chen, Huanwen
    Cai, Qiong
    Chen, Penghui
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2010, 7 (10) : 2013 - 2018
  • [9] Dynamic Co-Embedding Model for Temporal Attributed Networks
    Tang, Shaowei
    Meng, Zaiqiao
    Liang, Shangsong
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (03) : 3488 - 3502
  • [10] Temporal asynchrony analysis for dynamic operation of hydraulic-thermal-electricity multiple energy networks based on holomorphic embedding method
    Yang, Weijia
    Huang, Yuping
    Liao, Suliang
    Zhao, Daiqing
    Yao, Duan
    SUSTAINABLE ENERGY GRIDS & NETWORKS, 2024, 40