{"title":"TLP-NEGCN:通过网络嵌入和图卷积网络进行时态链接预测","authors":"Akshi Kumar;Abhishek Mallik;Sanjay Kumar","doi":"10.1109/TCSS.2024.3367231","DOIUrl":null,"url":null,"abstract":"Temporal link prediction (TLP) is a prominent problem in network analysis that focuses on predicting the existence of future connections or relationships between entities in a dynamic network over time. The predictive capabilities of existing models of TLP are often constrained due to their difficulty in adapting to the changes in dynamic network structures over time. In this article, an improved TLP model, denoted as TLP-NEGCN, is introduced by leveraging network embedding, graph convolutional networks (GCNs), and bidirectional long short-term memory (BiLSTM). This integration provides a robust model of TLP that leverages historical network structures and captures temporal dynamics leading to improved performances. We employ graph embedding with self-clustering (GEMSEC) to create lower dimensional vector representations for all nodes of the network at the initial timestamps. The node embeddings are fed into an iterative training process using GCNs across timestamps in the dataset. This process enhances the node embeddings by capturing the network's temporal dynamics and integrating neighborhood information. We obtain edge embeddings by concatenating the node embeddings of the end nodes of each edge, encapsulating the information about the relationships between nodes in the network. Subsequently, these edge embeddings are processed through a BiLSTM architecture to forecast upcoming links in the network. The performance of the proposed model is compared against several baselines and contemporary TLP models on various real-life temporal datasets. The obtained results based on various evaluation metrics demonstrate the superiority of the proposed work.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":null,"pages":null},"PeriodicalIF":4.5000,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"TLP-NEGCN: Temporal Link Prediction via Network Embedding and Graph Convolutional Networks\",\"authors\":\"Akshi Kumar;Abhishek Mallik;Sanjay Kumar\",\"doi\":\"10.1109/TCSS.2024.3367231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Temporal link prediction (TLP) is a prominent problem in network analysis that focuses on predicting the existence of future connections or relationships between entities in a dynamic network over time. The predictive capabilities of existing models of TLP are often constrained due to their difficulty in adapting to the changes in dynamic network structures over time. In this article, an improved TLP model, denoted as TLP-NEGCN, is introduced by leveraging network embedding, graph convolutional networks (GCNs), and bidirectional long short-term memory (BiLSTM). This integration provides a robust model of TLP that leverages historical network structures and captures temporal dynamics leading to improved performances. We employ graph embedding with self-clustering (GEMSEC) to create lower dimensional vector representations for all nodes of the network at the initial timestamps. The node embeddings are fed into an iterative training process using GCNs across timestamps in the dataset. This process enhances the node embeddings by capturing the network's temporal dynamics and integrating neighborhood information. We obtain edge embeddings by concatenating the node embeddings of the end nodes of each edge, encapsulating the information about the relationships between nodes in the network. Subsequently, these edge embeddings are processed through a BiLSTM architecture to forecast upcoming links in the network. The performance of the proposed model is compared against several baselines and contemporary TLP models on various real-life temporal datasets. The obtained results based on various evaluation metrics demonstrate the superiority of the proposed work.\",\"PeriodicalId\":13044,\"journal\":{\"name\":\"IEEE Transactions on Computational Social Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.5000,\"publicationDate\":\"2024-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Computational Social Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10475162/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10475162/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
TLP-NEGCN: Temporal Link Prediction via Network Embedding and Graph Convolutional Networks
Temporal link prediction (TLP) is a prominent problem in network analysis that focuses on predicting the existence of future connections or relationships between entities in a dynamic network over time. The predictive capabilities of existing models of TLP are often constrained due to their difficulty in adapting to the changes in dynamic network structures over time. In this article, an improved TLP model, denoted as TLP-NEGCN, is introduced by leveraging network embedding, graph convolutional networks (GCNs), and bidirectional long short-term memory (BiLSTM). This integration provides a robust model of TLP that leverages historical network structures and captures temporal dynamics leading to improved performances. We employ graph embedding with self-clustering (GEMSEC) to create lower dimensional vector representations for all nodes of the network at the initial timestamps. The node embeddings are fed into an iterative training process using GCNs across timestamps in the dataset. This process enhances the node embeddings by capturing the network's temporal dynamics and integrating neighborhood information. We obtain edge embeddings by concatenating the node embeddings of the end nodes of each edge, encapsulating the information about the relationships between nodes in the network. Subsequently, these edge embeddings are processed through a BiLSTM architecture to forecast upcoming links in the network. The performance of the proposed model is compared against several baselines and contemporary TLP models on various real-life temporal datasets. The obtained results based on various evaluation metrics demonstrate the superiority of the proposed work.
期刊介绍:
IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.