| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 39.5 KB | Microsoft Word |
Advisor(s)
Abstract(s)
Research on the problem of feature selection for clustering continues to develop. This is a challenging task, mainly due to the absence of class labels to guide the search for relevant features. Categorical feature selection for clustering has rarely been addressed in the literature, with most of the proposed approaches having focused on numerical data. In this work, we propose an approach to simultaneously cluster categorical data and select a subset of relevant features. Our approach is based on a modification of a finite mixture model (of multinomial distributions), where a set of latent variables indicate the relevance of each feature. To estimate the model parameters, we implement a variant of the expectation-maximization algorithm that simultaneously selects the subset of relevant features, using a minimum message length criterion. The proposed approach compares favourably with two baseline methods: a filter based on an entropy measure and a wrapper based on mutual information. The results obtained on synthetic data illustrate the ability of the proposed expectation-maximization method to recover ground truth. An application to real data, referred to official statistics, shows its usefulness.
Description
Keywords
Cluster analysis Finite mixture models EM-MML algorithm Feature selection Categorical features
Citation
Silvestre C., Cardoso M. G. M. S. and Figueiredo M. (2014), Feature selection for clustering categorical data with an embedded modelling approach, Expert Systems