High-Dimensional Data Clustering

Abstract

Clustering in high-dimensional spaces is a difficult problem which is recurrent in many domains, for example in image analysis. The difficulty is due to the fact that high-dimensional data usually live in different low-dimensional subspaces hidden in the original space. This paper presents a family of Gaussian mixture models designed for high-dimensional data which combine the ideas of dimension reduction and parsimonious modeling. These models give rise to a clustering method based on the Expectation-Maximization algorithm which is called High-Dimensional Data Clustering (HDDC). In order to correctly fit the data, HDDC estimates the specific subspace and the intrinsic dimension of each group. Our experiments on artificial and real datasets show that HDDC outperforms existing methods for clustering high-dimensional data

References in corpus (1)

• High-Dimensional Data Clustering

Cited by in corpus (43)

• High-Dimensional Data Clustering
• The discriminative functional mixture model for a comparative analysis of bike sharing systems
• Variable Selection Methods for Model-based Clustering
• Simultaneous model-based clustering and visualization in the Fisher discriminative subspace
• Parsimonious Skew Mixture Models for Model-Based Clustering and Classification
• Estimating Common Principal Components in High Dimensions
• Dimension reduction for model-based clustering
• Variational Bayes Approximations for Clustering via Mixtures of Normal Inverse Gaussian Distributions
• Clustering and Classification via Cluster-Weighted Factor Analyzers
• Mixtures of Common Skew-t Factor Analyzers
• A Mixture of Generalized Hyperbolic Factor Analyzers
• Structured Covariance Matrix Estimation with Missing-Data for Radar Applications via Expectation-Maximization
• Mixtures of Generalized Hyperbolic Distributions and Mixtures of Skew-t Distributions for Model-Based Clustering with Incomplete Data
• Reconstruction of Sentinel-2 Time Series Using Robust Gaussian Mixture Models -- Application to the Detection of Anomalous Crop Development in wheat and rapeseed crops
• Unsupervised Learning via Mixtures of Skewed Distributions with Hypercube Contours
• A Robust and Flexible EM Algorithm for Mixtures of Elliptical Distributions with Missing Data
• Mixture Model Averaging for Clustering
• Machine learning in APOGEE: Identification of stellar populations through chemical abundances
• The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension
• DiviK: Divisive intelligent K-Means for hands-free unsupervised clustering in big biological data
• Flexible Clustering for High-Dimensional Data via Mixtures of Joint Generalized Hyperbolic Models
• Anomaly Detection Based on Confidence Intervals Using SOM with an Application to Health Monitoring
• Large Scale Clustering with Variational EM for Gaussian Mixture Models
• On clustering uncertain and structured data with Wasserstein barycenters and a geodesic criterion for the number of clusters
• Pattern and Anomaly Detection in Urban Temporal Networks
• Clustering using skewed multivariate heavy tailed distributions with flexible tail behaviour
• Mixture of von Mises-Fisher distribution with sparse prototypes
• Deep Concept Identification for Generative Design
• Sparse Mixture Models inspired by ANOVA Decompositions
• Explainable cardiac pathology classification on cine MRI with motion characterization by semi-supervised learning of apparent flow
• Kernel discriminant analysis and clustering with parsimonious Gaussian process models
• Greedy clustering of count data through a mixture of multinomial PCA
• Effective Learning of a GMRF Mixture Model
• PCA Reduced Gaussian Mixture Models with Applications in Superresolution
• Improved Residual Vector Quantization for High-dimensional Approximate Nearest Neighbor Search
• Model-based Clustering with Missing Not At Random Data
• A Bayesian Fisher-EM algorithm for discriminative Gaussian subspace clustering
• The stellar host in star-forming low-mass galaxies: Evidence for two classes
• Flexible High-Dimensional Unsupervised Learning with Missing Data
• Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm
• Eigengap Sparsity for Covariance Parsimony
• Learning Better Encoding for Approximate Nearest Neighbor Search with Dictionary Annealing
• Stagewise Learning for Sparse Clustering of Discretely-Valued Data