Pith. sign in

REVIEW 2 cited by

NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification

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

arxiv 2406.19249 v1 pith:KEQ3DAKC submitted 2024-06-27 cs.LG

classification cs.LG
keywords graphnodetokenntformertransformerclassificationdifferentgraph-specific
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, the emerging graph Transformers have made significant advancements for node classification on graphs. In most graph Transformers, a crucial step involves transforming the input graph into token sequences as the model input, enabling Transformer to effectively learn the node representations. However, we observe that existing methods only express partial graph information of nodes through single-type token generation. Consequently, they require tailored strategies to encode additional graph-specific features into the Transformer to ensure the quality of node representation learning, limiting the model flexibility to handle diverse graphs. To this end, we propose a new graph Transformer called NTFormer to address this issue. NTFormer introduces a novel token generator called Node2Par, which constructs various token sequences using different token elements for each node. This flexibility allows Node2Par to generate valuable token sequences from different perspectives, ensuring comprehensive expression of rich graph features. Benefiting from the merits of Node2Par, NTFormer only leverages a Transformer-based backbone without graph-specific modifications to learn node representations, eliminating the need for graph-specific modifications. Extensive experiments conducted on various benchmark datasets containing homophily and heterophily graphs with different scales demonstrate the superiority of NTFormer over representative graph Transformers and graph neural networks for node classification.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DAM-GT: Dual Positional Encoding-Based Attention Masking Graph Transformer for Node Classification

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A graph Transformer with dual positional encoding and a star-shaped attention mask yields consistent accuracy improvements on node classification benchmarks.

  2. Rethinking Tokenized Graph Transformers for Node Classification

    cs.LG 2025-02 conditional novelty 5.0 of 10

    SwapGT augments tokenized graph Transformers with a random token swapping operation and a center alignment loss, reporting state-of-the-art accuracy on eight node classification datasets.

Pith tools