This work presents an approach that uses semantically meaningful, bimodal random walks on real-world heterogeneous networks to extract correlations between nodes and bring together nodes with shared or similar attributes.
This paper introduces a novel prototype-enhanced hypergraph learning approach for node classification in HINs using hypergraphs instead of graphs, which captures higher-order relationships among nodes and extracts semantic information without relying on metapaths.
Shuai Wang, Jiayi Shen, Athanasios Efthymiou et al.· 0 citations
This work proposes NumDAE—a novel differential-aware decouple-then-synergize embedding framework for HNKGs that reconstruct numeric semantics based on the relational context to endow numeric entities with algebraic computability, effectively decoupling pure physical quantity from the entangled topological background.
Ming Yin, Neng Gao· Proceedings of the 32nd ACM...· 0 citations
This paper introduces LaGR, a novel approach for integrating global information in knowledge graph reasoning that compresses the graph into a fixed, compact set of latent summaries and applies exact self-attention within this latent space, resulting in scale-invariant attention and stable performance across diverse dat...
Chen Lin, Lei Wang, Yin Zhang et al.· Proceedings of the Thirty-Fi...· 0 citations
A novel self-supervised framework for relational reasoning over RDBs that treats context sparsity as a controllable curriculum variable and leverages it to induce a progressive shift from semantic-dominant inference to structure-aware relational reasoning.
Yujie Tian, Kun Zhang, Qiu-Yuan Li et al.· Proceedings of the 32nd ACM...· 0 citations
DLP is more effective than state-of-the-art baselines on inductive link prediction and an integration of an LSTM and Transformer architecture is presented to improve the node representations and acquire the order of dependencies and the whole context.
Bin Yang, Meng-Qi Shi, Shuai-Shuai Liu et al.· Computer Vision, Graphics an...· 0 citations
This empirical study shows that candidate rankings change with the selected input, while predicted probabilities remain informative after the class stops changing, and leads to GraphSelect, which starts from individual candidate gains and refines the subset through jointly evaluated exchanges.
Xu Wang, Xun-Kai Li, Yin-Lin Zhu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.