Bringing Clustering to MLL: Weakly-Supervised Clustering for Partial Multi-Label Learning
Not on the map. Why?
Abstract (arXiv)
Label noise in multi-label learning (MLL) poses significant challenges for model training, particularly in partial multi-label learning (PML) where candidate labels contain both relevant and irrelevant labels. While clustering offers a natural approach to exploit data structure for noise identification, traditional clustering methods cannot be directly applied to multi-label scenarios due to a fundamental incompatibility: clustering produces membership values that sum to one per instance, whereas multi-label assignments require binary values that can sum to any number. We propose a novel weakly-supervised clustering approach for PML (WSC-PML) that bridges clustering and multi-label learning through membership matrix decomposition. Our key innovation decomposes the clustering membership matrix A into two components: A = Pi odot F, where Pi maintains clustering constraints while F preserves multi-label characteristics. This decomposition enables seamless integration of unsupervised clustering with multi-label supervision for effective label noise handling. WSC-PML employs a three-stage process: initial prototype learning from noisy labels, adaptive confidence-based weak supervision construction, and joint optimization via iterative clustering refinement. Extensive experiments on 24 datasets demonstrate that our approach outperforms six state-of-the-art methods across all evaluation metrics.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 2 of its 35 references that are in the map. First posted on arXiv 10 Apr 2026.
Builds on
2 of 35 references.
References · 2
Built on by
Not cited yet.