Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
From MaRDI portal
Publication:2147403
DOI10.1007/s10618-022-00820-9zbMath1497.62157arXiv2106.04330OpenAlexW4211171203MaRDI QIDQ2147403
Nicos G. Pavlidis, Hankui Peng
Publication date: 20 June 2022
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.04330
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Subspace clustering of high-dimensional data: a predictive approach
- \(k\)-plane clustering
- On constrained spectral clustering and its applications
- Algorithms for Fitting the Constrained Lasso
- Constrained Clustering
- Influence in principal components analysis
- Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
- Regularization and Variable Selection Via the Elastic Net
This page was built for publication: Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning