REVIEW 2 cited by
Multi-Scale Heterogeneous Text-Attributed Graph Datasets From Diverse Domains
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Heterogeneous Text-Attributed Graphs (HTAGs), where different types of entities are not only associated with texts but also connected by diverse relationships, have gained widespread popularity and application across various domains. However, current research on text-attributed graph learning predominantly focuses on homogeneous graphs, which feature a single node and edge type, thus leaving a gap in understanding how methods perform on HTAGs. One crucial reason is the lack of comprehensive HTAG datasets that offer original textual content and span multiple domains of varying sizes. To this end, we introduce a collection of challenging and diverse benchmark datasets for realistic and reproducible evaluation of machine learning models on HTAGs. Our HTAG datasets are multi-scale, span years in duration, and cover a wide range of domains, including movie, community question answering, academic, literature, and patent networks. We further conduct benchmark experiments on these datasets with various graph neural networks. All source data, dataset construction codes, processed HTAGs, data loaders, benchmark codes, and evaluation setup are publicly available at GitHub and Hugging Face.
Forward citations
Cited by 2 Pith papers
-
H$^2$GFM: Towards unifying Homogeneity and Heterogeneity on Text-Attributed Graphs
A graph foundation model with text-encoded meta-relations and a mixture of context-adaptive transformers improves accuracy across homogeneous and heterogeneous text-attributed graphs.
-
THGFM: Dual-Branch Temporal Heterogeneous Graph Fusion Model
THGFM couples shared-space and relation-partitioned attention branches with non-competitive gated fusion (TC-NGSF) and rotary temporal attention (RoTA), reporting +3.25% mean and +12.37% peak relative gains over a rei...
Discussion (0). Continue with ORCID to comment.