PINE: Pipeline for Important Node Exploration in Attributed Networks
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 14 of its 79 references that are in the map. First posted on arXiv 8 Dec 2025.
Builds on
14 of 79 references.
References · 14
- 2017Graph Attention Networkscited by 8,923
- 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 260
- 2017The spread of low-credibility content by social botscited by 73
- 2019Estimating Node Importance in Knowledge Graphs Using Graph Neural Networkscited by 43
- 2021PatentSBERTa: A Deep NLP based Hybrid Model for Patent Distance and Classification using Augmented SBERTcited by 24
- 2019Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approachcited by 16
- 2016Identifying a set of influential spreaders in complex networkscited by 10
- 2020Scalable Graph Neural Network-based framework for identifying critical nodes and links in Complex Networkscited by 10
- 2024PhysBERT: A Text Embedding Model for Physics Scientific Literaturecited by 8
- 2025Semi-supervised Node Importance Estimation with Informative Distribution Modeling for Uncertainty Regularizationcited by 4
- 2016Tracing technological development trajectories: A genetic knowledge persistence-based main path approachcited by 2
- 2023The disruption index is biased by citation inflationcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.