Sparse kernel k -means clustering
From MaRDI portal
Publication:7015944
Cites work
- A framework for feature selection in clustering
- A survey of kernel and spectral methods for clustering
- Adjusting for chance clustering comparison measures
- Biconvex Clustering
- Consistent selection of the number of clusters via crossvalidation
- Estimating the number of clusters in a data set via the gap statistic
- Feature selection for unsupervised learning
- Fréchet distance-based cluster analysis for multi-dimensional functional data
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 2101402 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Kernel variable selection for multicategory support vector machines
- Kernel-based hard clustering methods in the feature space with automatic variable weighting
- Multiple kernel learning algorithms
- NP-hardness of Euclidean sum-of-squares clustering
- Penalized model-based clustering
- Penalized model-based clustering with application to variable selection
- Penalized model-based clustering with unconstrained covariance matrices
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Smoothing spline ANOVA models
- Statistical comparisons of classifiers over multiple data sets
- Theory of Reproducing Kernels
- Variable Selection for Model-Based High-Dimensional Clustering and Its Application to Microarray Data
- Variable Selection in Penalized Model‐Based Clustering Via Regularization on Grouped Parameters
This page was built for publication: Sparse kernel k -means clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7015944)
