Bringing Clustering to MLL: Weakly-Supervised Clustering for Partial Multi-Label Learning
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 $\mathbf{A}$ into two components: $\mathbf{A} = \mathbfΠ \odot \mathbf{F}$, where $\mathbfΠ$ maintains clustering constraints while $\mathbf{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.
Code (0)
등록된 구현이 없습니다.
Tasks
Multi-Label LearningSimilar Papers 제목 키워드 기반
Partial Label Clustering
Partial label learning (PLL) is a significant weakly supervised learning framework, where each training example corresponds to a set of candidate labels and only one label is the ground-truth label. For the first time, t…
ClusteringConstrained ClusteringGraph LearningPartial Label Learning+1Weakly Supervised Graph Clustering
Graph Clustering, which clusters the nodes of a graph given its collection of node features and edge connections in an unsupervised manner, has long been researched in graph learning and is essential in certain applicati…
ClusteringGraph ClusteringGraph LearningImproving Event Representation via Simultaneous Weakly Supervised Contrastive Learning and Clustering
Representations of events described in text are important for various tasks. In this work, we present SWCC: a Simultaneous Weakly supervised Contrastive learning and Clustering framework for event representation learning…
ClusteringContrastive LearningRepresentation LearningSentence+1Weakly supervised clustering: Learning fine-grained signals from coarse labels
Consider a classification problem where we do not have access to labels for individual training examples, but only have average labels over subpopulations. We give practical examples of this setup and show how such a cla…
ClassificationClusteringGeneral ClassificationWeakly Supervised Clustering by Exploiting Unique Class Count
A weakly supervised learning based clustering framework is proposed in this paper. As the core of this framework, we introduce a novel multiple instance learning task based on a bag level label called unique class count …
ClusteringMultiple Instance LearningSemantic SegmentationWeakly-supervised Learning+1