2025· Neural Information Processing Systems· 0 citations· 50 references
Computer Science
TL;DR
A large-scale, universal, and joint multi-domain heterogeneous graph dataset named UniHG to facilitate heterogeneous graph representation learning and cross-domain knowledge mining and comprehensive benchmark results demonstrate that the model significantly out-performs existing methods with an accuracy improvement of 28.93%.
Abstract
Irregular data in the real world are usually organized as heterogeneous graphs consisting of multiple types of nodes and edges. However, current heterogeneous graph research confronts three fundamental challenges: i) Benchmark Deficiency, ii) Semantic Disalignment, and iii) Propagation Degradation. In this paper, we construct a large-scale, universal, and joint multi-domain heterogeneous graph dataset named UniHG to facilitate heterogeneous graph representation learning and cross-domain knowledge mining. Overall, UniHG contains 77.31 million nodes and 564 million directed edges with thousands of labels and attributes, which is currently the largest universal heterogeneous graph dataset available to the best of our knowledge. To perform effective learning and provide comprehensively benchmarks on UniHG , two key measures are taken, including i) the semantic alignment strategy for multi-attribute entities, which projects the feature description of multi-attribute nodes and edges into a common embedding space to facilitate information aggregation; ii) proposing the novel Heterogeneous Graph Decoupling (HGD) framework with a specifically designed Anisotropy Feature Propagation (AFP) module for learning effective multi-hop anisotropic propagation kernels. These two strategies enable efficient information propagation among a tremendous number of multi-attribute entities and meanwhile mine multi-attribute association adaptively through the multi-hop aggregation in large-scale heterogeneous graphs. Comprehensive benchmark results demonstrate that our model significantly out-performs existing methods with an accuracy improvement of 28.93%. And the UniHG can facilitate downstream tasks, achieving an NDCG
A combined HGT-based framework incorporating contrastive representation learning and deep clustering with multi-round training via pseudo-labels is presented, enabling the model to better deal with label scarcity, heterogeneous dependencies, and overlapping semantics in practical, complex, attributed networks.
Hamza Haddad, Hicham Attariuas, A. Younes· Edelweiss Applied Science an...· 0 citations
DeepIDDFS is introduced, a scalable node embedding designed for ER in large and dynamic graphs that employs an iterative deepening depth-first search (IDDFS), integrates BERT-based semantic embeddings to handle noisy and inconsistent attributes, and incorporates a time-aware aggregation mechanism that emphasizes recent...
Nour Mekki, Djamel Berrabah, Abdelhamid Malki· Knowledge and Information Sy...· 1 citation
This paper develops a comprehensive benchmark construction framework and constructs three diverse benchmark datasets and proposes a unified evaluation framework that assesses both linguistic quality and factual consistency, providing a comprehensive approach to evaluating generated summaries for content fidelity and ac...
Xiaoxuan Gou, Weiguo Zheng, Han-Qing Guo et al.· Proceedings of the 32nd ACM...· 0 citations
A Spectral-Aware Feature Alignment module to unify feature dimensionality and align cross-domain semantics in a community-aware manner and a Graph Diffusion Tokenized Transformer that constructs hybrid token sequences from local and global structural contexts for Transformer encoding, and applies diffusion-based refine...
Mo Li, Zhaosong Zhao, Linlin Ding et al.· Annual International ACM SIG...· 0 citations
A multi-semantic basis representation learning paradigm that models each multi-label node as an adaptive composition of semantic bases, thereby enabling flexible representational capacity for modeling multiple semantics.
Dong-Xiao He, Jia-Yu Zhang, Ji-Tao Zhao et al.· 0 citations
SliGFM is proposed, a graph foundation model built upon topology-aware sliding-window feature encoding and generative reconstruction that enables a smoothness-aware transformer to capture transferable relational patterns among feature tokens within each node, while the generative reconstruction objective encourages pre...