{"url":"/task/heterogeneous-node-classification","name":"Heterogeneous Node Classification","slug":"heterogeneous-node-classification","description_markdown":"Node classification in heterogeneous graphs, where nodes and/or edges have multiple types.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":16,"papers_with_code":14,"benchmarks":7,"benchmark_tables_in_archive":7,"benchmark_tables_shown":7,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":8,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/heterogeneous-node-classification-on-dblp-1","slug":"heterogeneous-node-classification-on-dblp-1","dataset":"DBLP (PACT) 14k","dataset_url":"/dataset/dblp","rows_in_archive":14,"metrics":["Micro-F1 (20% training data)","Macro-F1 (20% training data)","Macro-F1 (60% training data)","Micro-F1 (80% training data)","Macro-F1 (80% training data)"],"first_row_in_archive_order":{"model":"HAN","paper_title":"Heterogeneous Graph Attention Network","paper_url":"/paper/heterogeneous-graph-attention-network","paper_date":"2019-03-18","arxiv_id":"1903.07293","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/han"},{"title":"Jhy1993/HAN","url":"https://github.com/Jhy1993/HAN"},{"title":"JasonZhangzy1757/Heterogeneous-Graph-Attention-Network-HAN-PyTorch","url":"https://github.com/JasonZhangzy1757/Heterogeneous-Graph-Attention-Network-HAN-PyTorch"},{"title":"calderkatyal/CPSC483FinalProject","url":"https://github.com/calderkatyal/CPSC483FinalProject"}],"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":1}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-acm","slug":"heterogeneous-node-classification-on-acm","dataset":"ACM (Heterogeneous Node Classification)","dataset_url":"/dataset/acm-heterogeneous-node-classification","rows_in_archive":11,"metrics":[" Macro-F1","Micro-F1","Claim Classification Macro-F1","Macro-F1"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":8}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-dblp-2","slug":"heterogeneous-node-classification-on-dblp-2","dataset":"DBLP (Heterogeneous Node Classification)","dataset_url":"/dataset/dblp-heterogeneous-node-classification","rows_in_archive":11,"metrics":[" Macro-F1","Micro-F1","Macro-F1"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":8}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-imdb","slug":"heterogeneous-node-classification-on-imdb","dataset":"IMDB (Heterogeneous Node Classification)","dataset_url":"/dataset/imdb-heterogeneous-node-classification","rows_in_archive":11,"metrics":[" Macro-F1","Micro-F1","Macro-F1"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":8}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-freebase","slug":"heterogeneous-node-classification-on-freebase","dataset":"Freebase (Heterogeneous Node Classification)","dataset_url":"/dataset/freebase-heterogeneous-node-classification","rows_in_archive":9,"metrics":[" Macro-F1","Micro-F1","Macro-F1","Accuracy"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":8}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-oag","slug":"heterogeneous-node-classification-on-oag","dataset":"OAG-Venue","dataset_url":"/dataset/oag-venue","rows_in_archive":5,"metrics":["NDCG","MRR"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":8}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-oag-l1","slug":"heterogeneous-node-classification-on-oag-l1","dataset":"OAG-L1-Field","dataset_url":"/dataset/oag-l1-field","rows_in_archive":5,"metrics":["NDCG","MRR"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":8}}}],"datasets":[{"url":"/dataset/dblp","name":"DBLP","full_name":"Citation Network Dataset","num_papers_in_archive":218},{"url":"/dataset/acm-heterogeneous-node-classification","name":"ACM (Heterogeneous Node Classification)","full_name":"","num_papers_in_archive":12},{"url":"/dataset/dblp-heterogeneous-node-classification","name":"DBLP (Heterogeneous Node Classification)","full_name":"","num_papers_in_archive":12},{"url":"/dataset/imdb-heterogeneous-node-classification","name":"IMDB (Heterogeneous Node Classification)","full_name":"","num_papers_in_archive":11},{"url":"/dataset/freebase-heterogeneous-node-classification","name":"Freebase (Heterogeneous Node Classification)","full_name":"","num_papers_in_archive":9},{"url":"/dataset/oag-venue","name":"OAG-Venue","full_name":"","num_papers_in_archive":9},{"url":"/dataset/oag-l1-field","name":"OAG-L1-Field","full_name":"","num_papers_in_archive":5},{"url":"/dataset/supplygraph","name":"SupplyGraph","full_name":"SupplyGraph: A Benchmark Dataset for Supply Chain Planning using Graph Neural Networks","num_papers_in_archive":3}],"subtasks":[],"parent_tasks":[{"url":"/task/node-classification","name":"Node Classification"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":14,"of":14,"tagged_in_all":16,"items":[{"url":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":50,"n_unverified":56,"n_pointer_only":43}},{"url":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":31,"n_unverified":27,"n_pointer_only":22}},{"url":"/paper/modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":10,"n_unverified":22,"n_pointer_only":15}},{"url":"/paper/heterogeneous-graph-transformer","title":"Heterogeneous Graph Transformer","date":"2020-03-03","arxiv_id":"2003.01332","repositories_listed":4,"syntology":{"n":6,"n_ran":1,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/simple-and-efficient-heterogeneous-graph","title":"Simple and Efficient Heterogeneous Graph Neural Network","date":"2022-07-06","arxiv_id":"2207.02547","repositories_listed":2,"syntology":null},{"url":"/paper/are-we-really-making-much-progress-revisiting","title":"Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networks","date":"2021-12-30","arxiv_id":"2112.14936","repositories_listed":2,"syntology":null},{"url":"/paper/from-primes-to-paths-enabling-fast-multi","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","date":"2024-11-17","arxiv_id":"2411.11149","repositories_listed":1,"syntology":null},{"url":"/paper/slotgat-slot-based-message-passing-for","title":"SlotGAT: Slot-based Message Passing for Heterogeneous Graph Neural Network","date":"2024-05-03","arxiv_id":"2405.01927","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","arxiv_id":"2310.14481","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":8}},{"url":"/paper/scalable-graph-neural-networks-for-1","title":"Scalable Graph Neural Networks for Heterogeneous Graphs","date":"2020-11-19","arxiv_id":"2011.09679","repositories_listed":1,"syntology":null},{"url":"/paper/an-attention-based-graph-neural-network-for","title":"An Attention-based Graph Neural Network for Heterogeneous Structural Learning","date":"2019-12-19","arxiv_id":"1912.10832","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/non-local-attention-learning-on-large","title":"Non-local Attention Learning on Large Heterogeneous Information Networks","date":"2019-12-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","repositories_listed":1,"syntology":null},{"url":"/paper/graph-transformer-networks-1","title":"Graph Transformer Networks","date":"2019-11-06","arxiv_id":"1911.06455","repositories_listed":1,"syntology":null}],"syntology_records":7,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}