TY - GEN
T1 - CLASS
T2 - 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1, KDD 2026
AU - Luo, Tingjin
AU - Tong, Mengyuan
AU - Shu, Qingyang
AU - Liu, Yueying
AU - Zhou, Hao
AU - Wang, Zhen
N1 - Publisher Copyright:
© 2026 Owner/Author.
PY - 2026/4/20
Y1 - 2026/4/20
N2 - Partial label learning efficiently extracts accurate labels from weak supervision, where each instance has multiple candidate labels but only one is correct. Existing partial label learning methods typically employ a two-stage process and fall into a suboptimal solution in high-dimensional settings, lacking an effective feedback mechanism between feature selection and label disambiguation. Nevertheless, existing methods suffer from at least one of two issues, i.e., redundant features and the uncertainty of label disambiguation. To address these problems, we propose a unified and deep partial label feature selection method with CLuster-guided disAmbiguation and Structured Sparsity (CLASS), which simultaneously preserve discriminative features and promotes candidate label disambiguation by bidirectional optimization. Specifically, we integrate nonlinear deep networks to capture high-order semantic relations and feature interactions, while employing a linear sparse gating mechanism to preserve the label-specific, discriminative and interpretable features. Moreover, a cluster-guided disambiguation module is designed to enforce inter-class global separation and intra-class local cohesion via distance constraint and confidence penalty and dynamically align predicted labels with the semantics of class prototypes. Extensive experimental results validate the superiority and effectiveness of our proposed CLASS over state-of-the-art methods.
AB - Partial label learning efficiently extracts accurate labels from weak supervision, where each instance has multiple candidate labels but only one is correct. Existing partial label learning methods typically employ a two-stage process and fall into a suboptimal solution in high-dimensional settings, lacking an effective feedback mechanism between feature selection and label disambiguation. Nevertheless, existing methods suffer from at least one of two issues, i.e., redundant features and the uncertainty of label disambiguation. To address these problems, we propose a unified and deep partial label feature selection method with CLuster-guided disAmbiguation and Structured Sparsity (CLASS), which simultaneously preserve discriminative features and promotes candidate label disambiguation by bidirectional optimization. Specifically, we integrate nonlinear deep networks to capture high-order semantic relations and feature interactions, while employing a linear sparse gating mechanism to preserve the label-specific, discriminative and interpretable features. Moreover, a cluster-guided disambiguation module is designed to enforce inter-class global separation and intra-class local cohesion via distance constraint and confidence penalty and dynamically align predicted labels with the semantics of class prototypes. Extensive experimental results validate the superiority and effectiveness of our proposed CLASS over state-of-the-art methods.
KW - cluster-guided disambiguation
KW - deep feature selection
KW - partial label learning
KW - weakly supervised learning
UR - https://www.scopus.com/pages/publications/105038093818
U2 - 10.1145/3770854.3780163
DO - 10.1145/3770854.3780163
M3 - 会议稿件
AN - SCOPUS:105038093818
T3 - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
SP - 1007
EP - 1018
BT - KDD 2026 - Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1
PB - Association for Computing Machinery
Y2 - 9 August 2026 through 13 August 2026
ER -