Saved in:
Bibliographic Details
Main Authors: Zhao, Tianqi, Dong, Ngan Thi, Hanjalic, Alan, Khosla, Megha
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2304.10398
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913247121113088
author Zhao, Tianqi
Dong, Ngan Thi
Hanjalic, Alan
Khosla, Megha
author_facet Zhao, Tianqi
Dong, Ngan Thi
Hanjalic, Alan
Khosla, Megha
contents Graph Neural Networks (GNNs) have shown state-of-the-art improvements in node classification tasks on graphs. While these improvements have been largely demonstrated in a multi-class classification scenario, a more general and realistic scenario in which each node could have multiple labels has so far received little attention. The first challenge in conducting focused studies on multi-label node classification is the limited number of publicly available multi-label graph datasets. Therefore, as our first contribution, we collect and release three real-world biological datasets and develop a multi-label graph generator to generate datasets with tunable properties. While high label similarity (high homophily) is usually attributed to the success of GNNs, we argue that a multi-label scenario does not follow the usual semantics of homophily and heterophily so far defined for a multi-class scenario. As our second contribution, we define homophily and Cross-Class Neighborhood Similarity for the multi-label scenario and provide a thorough analyses of the collected $9$ multi-label datasets. Finally, we perform a large-scale comparative study with $8$ methods and $9$ datasets and analyse the performances of the methods to assess the progress made by current state of the art in the multi-label node classification scenario. We release our benchmark at https://github.com/Tianqi-py/MLGNC.
format Preprint
id arxiv_https___arxiv_org_abs_2304_10398
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Multi-label Node Classification On Graph-Structured Data
Zhao, Tianqi
Dong, Ngan Thi
Hanjalic, Alan
Khosla, Megha
Machine Learning
Graph Neural Networks (GNNs) have shown state-of-the-art improvements in node classification tasks on graphs. While these improvements have been largely demonstrated in a multi-class classification scenario, a more general and realistic scenario in which each node could have multiple labels has so far received little attention. The first challenge in conducting focused studies on multi-label node classification is the limited number of publicly available multi-label graph datasets. Therefore, as our first contribution, we collect and release three real-world biological datasets and develop a multi-label graph generator to generate datasets with tunable properties. While high label similarity (high homophily) is usually attributed to the success of GNNs, we argue that a multi-label scenario does not follow the usual semantics of homophily and heterophily so far defined for a multi-class scenario. As our second contribution, we define homophily and Cross-Class Neighborhood Similarity for the multi-label scenario and provide a thorough analyses of the collected $9$ multi-label datasets. Finally, we perform a large-scale comparative study with $8$ methods and $9$ datasets and analyse the performances of the methods to assess the progress made by current state of the art in the multi-label node classification scenario. We release our benchmark at https://github.com/Tianqi-py/MLGNC.
title Multi-label Node Classification On Graph-Structured Data
topic Machine Learning
url https://arxiv.org/abs/2304.10398