Sparse optimal discriminant clustering
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3626442 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
- A Method for Comparing Two Hierarchical Clusterings
- A Projection Pursuit Algorithm for Exploratory Data Analysis
- A Sober Look at Clustering Stability
- A framework for feature selection in clustering
- A new dimension reduction method: Factor discriminant \(K\)-means
- Clustering Objects on Subsets of Attributes (with Discussion)
- Consistent selection of the number of clusters via crossvalidation
- Consistent selection of tuning parameters via variable selection stability
- Estimating the number of clusters in a data set via the gap statistic
- Finding Groups in Data
- Finding the Number of Clusters in a Dataset
- Flexible Discriminant Analysis by Optimal Scoring
- Hierarchical clustering schemes
- Invariant co-ordinate selection (with discussion)
- Model Selection and Estimation in Regression with Grouped Variables
- On Using Principal Components Before Separating a Mixture of Two Multivariate Normal Distributions
- Regularization and Variable Selection Via the Elastic Net
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Selection of the number of clusters via the bootstrap method
- Simultaneous model-based clustering and visualization in the Fisher discriminative subspace
- Stability-Based Validation of Clustering Solutions
- Variable Selection for Model-Based Clustering
- Variable selection in model-based clustering: a general variable role modeling
- What is Projection Pursuit?
Cited in
(7)- Sparse probabilistic K-means
- Sparse Convex Clustering
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
- Robust discriminative clustering with sparse regularizers
- Robust and sparse multigroup classification by the optimal scoring approach
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis
- A simple approach to sparse clustering
This page was built for publication: Sparse optimal discriminant clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294233)