paper-with-me

Node Classification

138개 벤치마크 · 논문 2,076편 · 이 태스크의 논문 보기 →

Benchmarks

Cora

결과 73개

Citeseer

결과 71개

Pubmed

결과 71개

Wisconsin

결과 63개

Actor

결과 62개

Texas

결과 62개

Chameleon

결과 61개

Cornell

결과 60개

Squirrel

결과 59개

Penn94

결과 32개

genius

결과 26개

Coauthor CS

결과 24개

PPI

결과 24개

PascalVOC-SP

결과 21개

COCO-SP

결과 19개

Reddit

결과 16개

Cora (0.5%)

결과 15개

Cora (1%)

결과 15개

Cora (3%)

결과 15개

AMZ Photo

결과 14개

CiteSeer (0.5%)

결과 14개

CiteSeer (1%)

결과 14개

Coauthor Physics

결과 14개

PubMed (0.03%)

결과 14개

PubMed (0.05%)

결과 14개

PubMed (0.1%)

결과 14개

Amazon Computers

결과 12개

CLUSTER

결과 12개

arXiv-year

결과 12개

Amazon Photo

결과 11개

PATTERN

결과 11개

Cora Full-supervised

결과 9개

PATTERN 100k

결과 9개

Yelp-Fraud

결과 9개

AM

결과 8개

Facebook

결과 8개

Flickr

결과 8개

AIFB

결과 7개

AMZ Comp

결과 7개

BGS

결과 7개

Brazil Air-Traffic

결과 7개

Europe Air-Traffic

결과 7개

USA Air-Traffic

결과 7개

pokec

결과 7개

roman-empire

결과 7개

Amazon-Fraud

결과 6개

BlogCatalog

결과 6개

DBLP

결과 6개

MUTAG

결과 6개

Wiki-CS

결과 6개

Wiki-Vote

결과 6개

Wikipedia

결과 6개

AMZ Computers

결과 5개

Cora Full

결과 5개

Eximtradedata

결과 5개

Log Angeles

결과 5개

London

결과 5개

Paris

결과 5개

Placenta

결과 5개

Shanghai

결과 5개

AVA

결과 4개

MAG-scholar-C

결과 4개

MAG240M-LSC

결과 4개

MuMiN-large

결과 4개

MuMiN-medium

결과 4개

MuMiN-small

결과 4개

NELL

결과 4개

amazon-ratings

결과 4개

minesweeper

결과 4개

tolokers

결과 4개

MS ACADEMIC

결과 3개

questions

결과 3개

AMPLUS

결과 2개

Coauthor Phy

결과 2개

Crocodile

결과 2개

DMG777K

결과 2개

DMGFULL

결과 2개

Deezer Romania

결과 2개

MDGENRE

결과 2개

Wiki

결과 2개

YouTube

결과 2개

twitch-gamers

결과 2개

wiki

결과 2개

20NEWS

결과 1개

Amazon2M

결과 1개

BGP

결과 1개

Bitcoin-Alpha

결과 1개

Bitcoin-OTC

결과 1개

Cora random partition

결과 1개

Deezer Croatia

결과 1개

Deezer Hungary

결과 1개

Electronics

결과 1개

NBA

결과 1개

ogbn-products

결과 1개

Most implemented

Graph Attention Networks

2017-10-30 · 구현 93개

Papers

A Comparative Study of Counterfactual Explainers for Graph Neural Networks Enabling Multiple Types of Graph Edit

2026-09-04 · Maria Myrto Villia, Filippos Gouidis, Theodore Patkos, Panos Trahanias arxiv

Counterfactual explanations for graph-structured data seek to determine minimal and realistic modifications required in an input graph to alter a model's prediction to a predefined output. Although counterfactual explain…

Node Classification

PaSta: Noisy Node Classification with Partial Label Learning

2026-08-26 · Yujing Liu, Yixin Liu, Yu Zheng, Yue Tan 외 arxiv

Noisy node classification problem is a fundamental yet challenging task for real-world graph-related web services, where node labels are often corrupted or unreliable due to weak supervision or automatic annotation. Howe…

Partial Label LearningNode Classification

ReCoG: Reciprocal Co-Evolution for Multimodal Graph Learning

2026-08-24 · Rui Xue, Tianfu Wu arxiv

Multimodal graph learning requires jointly training over graph structure and heterogeneous node attributes, yet existing methods largely decouple these processes: prior multimodal graph neural networks (GNNs) focus on al…

Graph structure learningRepresentation LearningNode ClassificationLink Prediction

Fairness-Aware Network Embeddings: Methods, Applications, and Challenges

2026-08-19 · Ella Has, Harshith Kumar Yadav, Gaurav Dixit, Mykola Pechenizkiy 외 arxiv

Network embedding methods learn low-dimensional representations of graph-structured data to support downstream tasks such as node classification, link prediction, and influence maximization. However, real-world networks …

Representation LearningGraph Neural NetworkNode ClassificationLink Prediction

Dynamic Graph Prompting via Topology-Routed Mixed-Curvature Experts

2026-08-06 · Quanxin Wang, Xuanting Xie, Bingheng Li, Xingtong Yu 외 arxiv

Dynamic graph prompting freezes a pre-trained temporal backbone and adapts it to label-scarce downstream tasks using lightweight prompts. However, existing methods operate within a single, fixed embedding space. In this …

Node ClassificationLink Prediction

Nonlinear Laplacians Improve Signed-Directed Graph Learning

2026-08-01 · Ali Parviz, Yuichi Yoshida arxiv

While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Laplacian operators for such networks. We int…

Node ClassificationLink PredictionGraph Learning

전체 2,076편 보기 →