Multi-perspective Memory Enhanced Network for Identifying Key Nodes in Social Networks
Identifying key nodes in social networks plays a crucial role in timely blocking false information. Existing key node identification methods usually consider node influence only from the propagation structure perspective and have insufficient generalization ability to unknown scenarios. In this paper, we propose a novel Multi-perspective Memory Enhanced Network (MMEN) for identifying key nodes in social networks, which mines key nodes from multiple perspectives and utilizes memory networks to store historical information. Specifically, MMEN first constructs two propagation networks from the perspectives of user attributes and propagation structure and updates node feature representations using graph attention networks. Meanwhile, the memory network is employed to store information of similar subgraphs, enhancing the model's generalization performance in unknown scenarios. Finally, MMEN applies adaptive weights to combine the node influence of the two propagation networks to select the ultimate key nodes. Extensive experiments demonstrate that our method significantly outperforms previous methods.
Code (0)
등록된 구현이 없습니다.
Tasks
BlockingGraph AttentionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
FTF-ER: Feature-Topology Fusion-Based Experience Replay Method for Continual Graph Learning
Continual graph learning (CGL) is an important and challenging task that aims to extend static GNNs to dynamic task flow scenarios. As one of the mainstream CGL methods, the experience replay (ER) method receives widespr…
class-incremental learningClass Incremental LearningGraph LearningIncremental LearningFinding influential nodes for integration in brain networks using optimal percolation theory
Global integration of information in the brain results from complex interactions of segregated brain networks. Identifying the most influential neuronal populations that efficiently bind these networks is a fundamental p…
A New Paradigm for Minimax Search
This paper introduces a new paradigm for minimax game-tree search algo- rithms. MT is a memory-enhanced version of Pearls Test procedure. By changing the way MT is called, a number of best-first game-tree search algorith…
FedRewind: Rewinding Continual Model Exchange for Decentralized Federated Learning
In this paper, we present FedRewind, a novel approach to decentralized federated learning that leverages model exchange among nodes to address the issue of data distribution shift. Drawing inspiration from continual lear…
Continual LearningFederated LearningLLM-Enhanced Energy Contrastive Learning for Out-of-Distribution Detection in Text-Attributed Graphs
Text-attributed graphs, where nodes are enriched with textual attributes, have become a powerful tool for modeling real-world networks such as citation, social, and transaction networks. However, existing methods for lea…
Out-of-Distribution DetectionContrastive LearningNode Classification