Quantile-based clustering
From MaRDI portal
Abstract: A new cluster analysis method, -quantiles clustering, is introduced. -quantiles clustering can be computed by a simple greedy algorithm in the style of the classical Lloyd's algorithm for -means. It can be applied to large and high-dimensional datasets. It allows for within-cluster skewness and internal variable scaling based on within-cluster variation. Different versions allow for different levels of parsimony and computational efficiency. Although -quantiles clustering is conceived as nonparametric, it can be connected to a fixed partition model of generalized asymmetric Laplace-distributions. The consistency of -quantiles clustering is proved, and it is shown that -quantiles clusters correspond to well separated mixture components in a nonparametric mixture. In a simulation, -quantiles clustering is compared with a number of popular clustering methods with good results. A high-dimensional microarray dataset is clustered by -quantiles.
Recommendations
Cites work
- scientific article; zbMATH DE number 5430929 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 4076317 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- A multivariate and asymmetric generalization of Laplace distribution
- A statistical view of clustering performance through the theory of U-processes
- Asymptotic Statistics
- Asymptotic behaviour of classification maximum likelihood estimates
- Clustering Objects on Subsets of Attributes (with Discussion)
- Clustering by passing messages between data points
- Clustering strategy and method selection
- Consistency of spectral clustering
- Finding Groups in Data
- Finite mixture models
- Generating random correlation matrices based on partial correlations
- Least squares quantization in PCM
- Method-independent indices for cluster validation and estimating the number of clusters
- Mixtures of distance-based models for ranking data
- NON-NULL RANKING MODELS. I
- Nearest neighbor clustering: a baseline method for consistent clustering with arbitrary objective functions
- Probabilistic d-clustering
- Quantile-based classifiers
- Quantile-based clustering
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
- Resampling methods for exploring cluster stability
- Strong consistency of k-means clustering
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- Weighting and selection of variables for cluster analysis
Cited in
(6)
This page was built for publication: Quantile-based clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q107146)