Clustering with feature selection using alternating minimization, Application to computational biology
This paper deals with unsupervised clustering with feature selection. The problem is to estimate both labels and a sparse projection matrix of weights. To address this combinatorial non-convex problem maintaining a strict control on the sparsity of the matrix of weights, we propose an alternating minimization of the Frobenius norm criterion. We provide a new efficient algorithm named K-sparse which alternates k-means with projection-gradient minimization. The projection-gradient step is a method of splitting type, with exact projection on the $\ell^1$ ball to promote sparsity. The convergence of the gradient-projection step is addressed, and a preliminary analysis of the alternating minimization is made. The Frobenius norm criterion converges as the number of iterates in Algorithm K-sparse goes to infinity. Experiments on Single Cell RNA sequencing datasets show that our method significantly improves the results of PCA k-means, spectral clustering, SIMLR, and Sparcl methods, and achieves a relevant selection of genes. The complexity of K-sparse is linear in the number of samples (cells), so that the method scales up to large datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Clusteringfeature selectionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
SCAMS: Simultaneous Clustering and Model Selection
While clustering has been well studied in the past decade, model selection has drawn less attention. This paper addresses both problems in a joint manner with an indicator matrix formulation, in which the clustering cost…
ClusteringmodelModel SelectionAn Efficient Smoothing Proximal Gradient Algorithm for Convex Clustering
Cluster analysis organizes data into sensible groupings and is one of fundamental modes of understanding and learning. The widely used K-means and hierarchical clustering methods can be dramatically suboptimal due to loc…
ClusteringStructured Sparse Non-negative Matrix Factorization with L20-Norm for scRNA-seq Data Analysis
Non-negative matrix factorization (NMF) is a powerful tool for dimensionality reduction and clustering. Unfortunately, the interpretation of the clustering results from NMF is difficult, especially for the high-dimension…
ClusteringDimensionality Reductionfeature selectionNonlinear matrix recovery using optimization on the Grassmann manifold
We investigate the problem of recovering a partially observed high-rank matrix whose columns obey a nonlinear structure such as a union of subspaces, an algebraic variety or grouped in clusters. The recovery problem is f…
Riemannian optimizationSecond-order methodsSplitting Methods for Convex Clustering
Clustering is a fundamental problem in many scientific applications. Standard methods such as $k$-means, Gaussian mixture models, and hierarchical clustering, however, are beset by local minima, which are sometimes drast…
Clustering