mlsanityData to 7 Oct 2026

Deep Structural Knowledge Exploitation and Synergy for Estimating Node Importance Value on Heterogeneous Information Networks

arXiv 2402.12411 ↗First posted 19 Feb 2024cs.SI cs.AI cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

Node importance estimation problem has been studied conventionally with homogeneous network topology analysis. To deal with network heterogeneity, a few recent methods employ graph neural models to automatically learn diverse sources of information. However, the major concern revolves around that their full adaptive learning process may lead to insufficient information exploration, thereby formulating the problem as the isolated node value prediction with underperformance and less interpretability. In this work, we propose a novel learning framework: SKES. Different from previous automatic learning designs, SKES exploits heterogeneous structural knowledge to enrich the informativeness of node representations. Based on a sufficiently uninformative reference, SKES estimates the importance value for any input node, by quantifying its disparity against the reference. This establishes an interpretable node importance computation paradigm. Furthermore, SKES dives deep into the understanding that "nodes with similar characteristics are prone to have similar importance values" whilst guaranteeing that such informativeness disparity between any different nodes is orderly reflected by the embedding distance of their associated latent features. Extensive experiments on three widely-evaluated benchmarks demonstrate the performance superiority of SKES over several recent competing methods.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 26 of its 61 references that are in the map. First posted on arXiv 19 Feb 2024.

Builds on

26 of 61 references.

References · 26

  1. 2017Attention Is All You Needcited by 59,932
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  3. 2017Graph Attention Networkscited by 8,854
  4. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  5. 2020MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embeddingcited by 304
  6. 2022PointCLIP V2: Prompting CLIP and GPT for Powerful 3D Open-world Learningcited by 186
  7. 2022Spectral Feature Augmentation for Graph Contrastive Learning and Beyondcited by 49
  8. 2023Do Large Language Models Know about Facts?cited by 49
  9. 2019Estimating Node Importance in Knowledge Graphs Using Graph Neural Networkscited by 43
  10. 2020SelfORE: Self-supervised Relational Feature Learning for Open Relation Extractioncited by 43
  11. 2022Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distancescited by 41
  12. 2021Modeling Scale-free Graphs with Hyperbolic Geometry for Knowledge-aware Recommendationcited by 38
14 more
  1. 2022CHEF: A Pilot Chinese Dataset for Evidence-Based Fact-Checkingcited by 37
  2. 2020Unsupervised Text Generation by Learning from Searchcited by 36
  3. 2020Semi-supervised Relation Extraction via Incremental Meta Self-Trainingcited by 35
  4. 2021Gradient Imitation Reinforcement Learning for Low Resource Relation Extractioncited by 33
  5. 2023Dynamically Expandable Graph Convolution for Streaming Recommendationcited by 26
  6. 2021Unsupervised Hashing with Contrastive Information Bottleneckcited by 24
  7. 2022A Unified Strategy for Multilingual Grammatical Error Correction with Pre-trained Cross-Lingual Language Modelcited by 16
  8. 2021Attentive Knowledge-aware Graph Convolutional Networks with Collaborative Guidance for Personalized Recommendationcited by 12
  9. 2022Learning Binarized Graph Representations with Multi-faceted Quantization Reinforcement for Top-K Recommendationcited by 10
  10. 2020MultiImport: Inferring Node Importance in a Knowledge Graph from Multiple Input Signalscited by 9
  11. 2023Dynamic Embedding Size Search with Minimum Regret for Streaming Recommender Systemcited by 7
  12. 2023WSFE: Wasserstein Sub-graph Feature Encoder for Effective User Segmentation in Collaborative Filteringcited by 4
  13. 2021A Literature Review of Recent Graph Embedding Techniques for Biomedical Datacited by 3
  14. 2022Efficient Document Retrieval by End-to-End Refining and Quantizing BERT Embedding with Contrastive Product Quantizationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 2.

9 papers.