Saved in:
Bibliographic Details
Main Authors: Song, Jiebo, Ling, Huaming
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2505.06863
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909607328219136
author Song, Jiebo
Ling, Huaming
author_facet Song, Jiebo
Ling, Huaming
contents To further utilize the unsupervised features and pairwise information, we propose a general Bilevel Clustering Optimization (BCO) framework to improve the performance of clustering. And then we introduce three special cases on subspace clustering with two different types of masks. At first, we reformulate the original subspace clustering as a Basic Masked Subspace Clustering (BMSC), which reformulate the diagonal constraints to a hard mask. Then, we provide a General Masked Subspace Clustering (GMSC) method to integrate different clustering via a soft mask. Furthermore, based on BCO and GMSC, we induce a learnable soft mask and design a Recursive Masked Subspace Clustering (RMSC) method that can alternately update the affinity matrix and the soft mask. Numerical experiments show that our models obtain significant improvement compared with the baselines on several commonly used datasets, such as MNIST, USPS, ORL, COIL20 and COIL100.
format Preprint
id arxiv_https___arxiv_org_abs_2505_06863
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Masked Subspace Clustering Methods
Song, Jiebo
Ling, Huaming
Machine Learning
Optimization and Control
To further utilize the unsupervised features and pairwise information, we propose a general Bilevel Clustering Optimization (BCO) framework to improve the performance of clustering. And then we introduce three special cases on subspace clustering with two different types of masks. At first, we reformulate the original subspace clustering as a Basic Masked Subspace Clustering (BMSC), which reformulate the diagonal constraints to a hard mask. Then, we provide a General Masked Subspace Clustering (GMSC) method to integrate different clustering via a soft mask. Furthermore, based on BCO and GMSC, we induce a learnable soft mask and design a Recursive Masked Subspace Clustering (RMSC) method that can alternately update the affinity matrix and the soft mask. Numerical experiments show that our models obtain significant improvement compared with the baselines on several commonly used datasets, such as MNIST, USPS, ORL, COIL20 and COIL100.
title Masked Subspace Clustering Methods
topic Machine Learning
Optimization and Control
url https://arxiv.org/abs/2505.06863