Browse State-of-the-Art › Heterogeneous Node Classification
Heterogeneous Node Classification
14 papers with code · 7 benchmarks · 8 datasets archive 2025-07-28
Node classification in heterogeneous graphs, where nodes and/or edges have multiple types.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
7 leaderboard tables shown for this task, 7 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
8 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 16 · with a code link: 14 · where Syntology ran a sample: 6 (6 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (6 of 16 tagged: 6 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 16 of 16, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
30 Oct 2017 93 repositories listed Syntology community repositories only · 61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified (of 106 harvested samples) · 46 pointer-only (licence)We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph…
-
9 Sep 2016 55 repositories listed Syntology community repositories only · 39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified (of 58 harvested samples) · 23 pointer-only (licence)We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs.
-
17 Mar 2017 27 repositories listed Syntology official (archive's flag): 5 ran · 18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified (of 32 harvested samples) · 15 pointer-only (licence)We demonstrate the effectiveness of R-GCNs as a stand-alone model for entity classification.
-
3 Mar 2020 4 repositories listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified (of 6 harvested samples) · 3 pointer-only (licence)Recent years have witnessed the emerging success of graph neural networks (GNNs) for modeling structured data.
-
6 Jul 2022 2 repositories listedHeterogeneous graph neural networks (HGNNs) have powerful capability to embed rich structural and semantic information of a heterogeneous graph into node representations.
-
30 Dec 2021 2 repositories listedHeterogeneous graph neural networks (HGNNs) have been blossoming in recent years, but the unique data processing and evaluation setups used by each work obstruct a full understanding of their advancements.
-
17 Nov 2024 1 repository listedThis enables a compact representation of a complete multi-relational graph using a single adjacency matrix, which, in turn, facilitates quick computation of multi-hop adjacency matrices.
-
3 May 2024 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples)We identify a potential semantic mixing issue in existing message passing processes, where the representations of the neighbors of a node v are forced to be transformed to the feature space of v for aggregation, though…
-
23 Oct 2023 1 repository listed Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 8 harvested samples) · 8 pointer-only (licence)To achieve low information loss, we introduce a Relation-wise Neighbor Collection component with an Even-odd Propagation Scheme, which aims to collect information from neighbors in a finer-grained way.
-
19 Nov 2020 1 repository listedGraph neural networks (GNNs) are a popular class of parametric model for learning over graph-structured data.
-
19 Dec 2019 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 3 unverified (of 3 harvested samples)In this paper, we focus on graph representation learning of heterogeneous information network (HIN), in which various types of vertices are connected by various types of relations.
-
12 Dec 2019 1 repository listedIn this way, it leverages both local and non-local information simultaneously.
-
19 Nov 2019 1 repository listedThe derived node representations can be used to serve various downstream tasks, such as node classification and node clustering.
-
6 Nov 2019 1 repository listedIn this paper, we propose Graph Transformer Networks (GTNs) that are capable of generating new graph structures, which involve identifying useful connections between unconnected nodes on the original graph, while…
-
Heterogeneous Graph Attention Networks for Semi-supervised Short Text Classification1 Nov 2019 0 repositories listedShort text classification has found rich and critical applications in news and tweet tagging to help users find relevant information.
-
Multi-Relational Classification via Bayesian Ranked Non-Linear Embeddings6 Aug 2019 0 repositories listedThe task of classifying multi-relational data spans a wide range of domains such as document classification in citation networks, classification of emails, and protein labeling in proteins interaction graphs.
Syntology lines on 7 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections