无监督识别带属性图中重要节点,兼顾结构与语义信息。
PINE: Pipeline for Important Node Exploration in Attributed Networks
- 基于注意力机制的图模型,融合节点语义特征与网络结构。
- 在异构和同构图上优于传统方法,无需标签监督。
- 适合企业级大规模图数据中的关键实体发现。
具有语义属性的节点图是众多领域中的常见数据结构,如互联网页或科学论文引用网络。该数据类型的核心问题是识别出比其他节点更重要的关键节点,这对系统监控与管理至关重要。传统方法依赖中心性度量(如节点度或PageRank),但仅考虑网络结构而忽略丰富的节点属性。近期方法虽使用神经网络处理节点特征,但需监督学习。本文填补这一空白,提出无监督且属性感知的节点重要性探索框架PINE。其核心为基于注意力的图模型,将节点语义特征融入对图结构特性的学习过程。节点重要性得分由获得的注意力分布决定。实验表明,PINE在多种同质与异构属性图上表现更优。作为工业实现系统,PINE成功应对了大规模企业图中关键实体的无监督识别挑战。
原文摘要 · Abstract (English)
A graph with semantically attributed nodes are a common data structure in a wide range of domains. It could be interlinked web data or citation networks of scientific publications. The essential problem for such a data type is to determine nodes that carry greater importance than all the others, a task that markedly enhances system monitoring and management. Traditional methods to identify important nodes in networks introduce centrality measures, such as node degree or more complex PageRank. However, they consider only the network structure, neglecting the rich node attributes. Recent methods adopt neural networks capable of handling node features, but they require supervision. This work addresses the identified gap--the absence of approaches that are both unsupervised and attribute-aware--by introducing a Pipeline for Important Node Exploration (PINE). At the core of the proposed framework is an attention-based graph model that incorporates node semantic features in the learning process of identifying the structural graph properties. The PINE's node importance scores leverage the obtained attention distribution. We demonstrate the superior performance of the proposed PINE method on various homogeneous and heterogeneous attributed networks. As an industry-implemented system, PINE tackles the real-world challenge of unsupervised identification of key entities within large-scale enterprise graphs.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。