通过因果嵌入提升复杂网络节点重要性排序的跨网络泛化能力
Importance Ranking in Complex Networks via Influence-aware Causal Node Embedding
- 基于自编码器设计影响感知的因果节点嵌入模块
- 在多个基准数据集上优于现有方法,跨网络迁移性能显著提升
- 适用于结构未知或隐私受限场景下的节点重要性分析
理解与量化节点重要性是网络科学与工程中的基础问题,支撑影响力最大化、社交推荐和网络瓦解等应用。以往研究多依赖中心性指标或仅使用拓扑信息的图嵌入技术,再通过下游分类/回归识别关键节点,但这些方法常将表示学习与排序目标分离,严重依赖目标网络的拓扑结构,导致特征与任务不一致,跨网络泛化能力差。本文提出一种新框架,利用因果表示学习获取适用于跨网络排序任务的鲁棒且不变的节点嵌入。具体地,在自编码器架构中引入影响感知的因果节点嵌入模块,提取与节点重要性有因果关联的嵌入;同时设计统一优化框架,结合因果排序损失,联合优化重建与排序目标,实现表示学习与排序优化的相互增强。该模型可在合成网络上训练,并有效泛化至多种真实网络。大量实验表明,所提模型在排名准确率和跨网络迁移能力上均持续优于现有最优基线,为网络分析与工程应用提供了新思路,尤其适用于目标网络结构事先不可知(如因隐私或安全限制)的场景。
原文摘要 · Abstract (English)
Understanding and quantifying node importance is a fundamental problem in network science and engineering, underpinning a wide range of applications such as influence maximization, social recommendation, and network dismantling. Prior research often relies on centrality measures or advanced graph embedding techniques using structural information, followed by downstream classification or regression tasks to identify critical nodes. However, these approaches typically decouple node representation learning from the ranking objective and depend heavily on the topological structure of target networks, leading to feature-task inconsistency and poor cross-network generalization. This paper proposes a novel framework that leverages causal representation learning to obtain robust and invariant node embeddings for cross-network ranking tasks. Specifically, we introduce an influence-aware causal node embedding module within an autoencoder architecture to extract node embeddings that are causally related to node importance. Furthermore, we design a unified optimization framework incorporating a causal ranking loss that jointly optimizes reconstruction and ranking objectives, thereby enabling mutual reinforcement between node representation learning and ranking optimization. This design allows the proposed model to be trained on synthetic networks and to generalize effectively across diverse real-world networks. Extensive experiments on multiple benchmark datasets demonstrate that the proposed model consistently outperforms state-of-the-art baselines in terms of both ranking accuracy and cross-network transferability, offering new insights for network analysis and engineering applications-particularly in scenarios where the target network's structure is inaccessible in advance due to privacy or security constraints.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。