Model-based subspace clustering of non-Gaussian data

Authors:
Sabri Boutemedjet;Djemel Ziou;Nizar Bouguila
Affiliations:
Département d'Informatique, Université de Sherbrooke, Sherbrooke, QC, Canada J1K 2R1;Département d'Informatique, Université de Sherbrooke, Sherbrooke, QC, Canada J1K 2R1;Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, Canada H3G 2W1
Venue:
Neurocomputing
Year:
2010

Citing 28
Cited 2

Automatic subspace clustering of high dimensional data for data mining applications

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Entropy-based subspace clustering for mining numerical data

KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Probabilistic latent semantic indexing

Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Scalability for clustering algorithms revisited

ACM SIGKDD Explorations Newsletter
Unsupervised Learning of Finite Mixture Models

IEEE Transactions on Pattern Analysis and Machine Intelligence
Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope

International Journal of Computer Vision
An introduction to variable and feature selection

The Journal of Machine Learning Research
Recognition with Local Features: the Kernel Recipe

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
Feature Selection for Unsupervised Learning

The Journal of Machine Learning Research
Simultaneous Feature Selection and Clustering Using Mixture Models

IEEE Transactions on Pattern Analysis and Machine Intelligence
Toward Integrating Feature Selection Algorithms for Classification and Clustering

IEEE Transactions on Knowledge and Data Engineering
Statistical and Inductive Inference by Minimum Message Length (Information Science and Statistics)

Statistical and Inductive Inference by Minimum Message Length (Information Science and Statistics)
Practical Bayesian estimation of a finite beta mixture through gibbs sampling and its applications

Statistics and Computing
Comparing Subspace Clusterings

IEEE Transactions on Knowledge and Data Engineering
Unsupervised Selection of a Finite Dirichlet Mixture Model: An MML-Based Approach

IEEE Transactions on Knowledge and Data Engineering
Penalized Model-Based Clustering with Application to Variable Selection

The Journal of Machine Learning Research
High-Dimensional Unsupervised Selection and Estimation of a Finite Generalized Dirichlet Mixture Model Based on Minimum Message Length

IEEE Transactions on Pattern Analysis and Machine Intelligence
KPCA for semantic object extraction in images

Pattern Recognition
Scene classification via pLSA

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part IV
Boosting GMM and its two applications

MCS'05 Proceedings of the 6th international conference on Multiple Classifier Systems
Unsupervised learning of parsimonious mixtures on large spaces with integrated feature and component selection

IEEE Transactions on Signal Processing
A Graphical Model for Context-Aware Visual Content Recommendation

IEEE Transactions on Multimedia
Effective Feature Extraction in High-Dimensional Space

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Paper: Modeling by shortest data description

Automatica (Journal of IFAC)
Image classification for content-based indexing

IEEE Transactions on Image Processing
A hybrid SEM algorithm for high-dimensional unsupervised learning using a finite generalized Dirichlet mixture

IEEE Transactions on Image Processing
Gabor-Based Region Covariance Matrices for Face Recognition

IEEE Transactions on Circuits and Systems for Video Technology

Variational learning of finite Dirichlet mixture models using component splitting

Neurocomputing
Semi-supervised projected model-based clustering

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a new generalized Dirichlet (GD) mixture model to address the challenging problem of clustering multidimensional data sets on different feature subsets. We approximate class-conditional distributions of mixture components to define binary relevance of features at the level of clusters. We consider a relevant feature as the one providing the knowledge to assign data points in the cluster. Then, we define a new message length objective to learn the model and select both feature subsets and the number of components. The proposed method is general comparatively with existing feature selection and subspace clustering models. In addition, it selects for each cluster only relevant and statistically independent features in a linear time of the number of observations and dimensions. Experiments on synthetic data and in unsupervised image categorization show the merits of our approach.