Subspace clustering of high-dimensional data: a predictive approach
From MaRDI portal
Publication:740601
DOI10.1007/s10618-013-0317-yzbMath1294.68119arXiv1203.1065OpenAlexW2025391886MaRDI QIDQ740601
Brian McWilliams, Giovanni Montana
Publication date: 3 September 2014
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.1065
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Protein sequences, DNA sequences (92D20)
Related Items (6)
Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning ⋮ Subspace clustering with automatic feature grouping ⋮ Lossy compression approach to subspace clustering ⋮ Dense community detection in multi-valued attributed networks ⋮ Robust subspace clustering ⋮ Subspace clustering of high-dimensional data: a predictive approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- A survey on enhanced subspace clustering
- Subspace clustering of high-dimensional data: a predictive approach
- Sparse principal component analysis via regularized low rank matrix approximation
- Influential observations, high leverage points, and outliers in linear regression
- Asymptotic convergence analysis of the projection approximation subspace tracking algorithms
- Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
- \(k\)-plane clustering
- Hybrid linear modeling via local best-fit flats
- Pathwise coordinate optimization
- Identifying multiple influential observations in linear regression
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- A Framework for Feature Selection in Clustering
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
This page was built for publication: Subspace clustering of high-dimensional data: a predictive approach
