LGAIMay 30, 2023

GraphCleaner: Detecting Mislabelled Samples in Popular Graph Learning Benchmarks

arXiv:2306.00015v110 citationsHas Code
Originality Incremental advance
AI Analysis

This addresses data quality issues for researchers and practitioners using graph learning benchmarks, though it is incremental as it extends mislabel detection to graph data.

The paper tackles the problem of mislabelled samples in graph datasets by proposing GraphCleaner, a method that detects and corrects these errors, resulting in an average improvement of 0.14 in F1 score and 0.16 in MCC, and boosting performance on PubMed from 86.71% to 89.11% after removal.

Label errors have been found to be prevalent in popular text, vision, and audio datasets, which heavily influence the safe development and evaluation of machine learning algorithms. Despite increasing efforts towards improving the quality of generic data types, such as images and texts, the problem of mislabel detection in graph data remains underexplored. To bridge the gap, we explore mislabelling issues in popular real-world graph datasets and propose GraphCleaner, a post-hoc method to detect and correct these mislabelled nodes in graph datasets. GraphCleaner combines the novel ideas of 1) Synthetic Mislabel Dataset Generation, which seeks to generate realistic mislabels; and 2) Neighborhood-Aware Mislabel Detection, where neighborhood dependency is exploited in both labels and base classifier predictions. Empirical evaluations on 6 datasets and 6 experimental settings demonstrate that GraphCleaner outperforms the closest baseline, with an average improvement of 0.14 in F1 score, and 0.16 in MCC. On real-data case studies, GraphCleaner detects real and previously unknown mislabels in popular graph benchmarks: PubMed, Cora, CiteSeer and OGB-arxiv; we find that at least 6.91% of PubMed data is mislabelled or ambiguous, and simply removing these mislabelled data can boost evaluation performance from 86.71% to 89.11%.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes