Clustering and selecting categorical features

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In data clustering, the problem of selecting the subset of most relevant features from the data has been an active research topic. Feature selection for clustering is a challenging task due to the absence of class labels for guiding the search for relevant features. Most methods proposed for this goal are focused on numerical data. In this work, we propose an approach for clustering and selecting categorical features simultaneously. We assume that the data originate from a finite mixture of multinomial distributions and implement an integrated expectation-maximization (EM) algorithm that estimates all the parameters of the model and selects the subset of relevant features simultaneously. The results obtained on synthetic data illustrate the performance of the proposed approach. An application to real data, referred to official statistics, shows its usefulness. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Silvestre, C., Cardoso, M., & Figueiredo, M. (2013). Clustering and selecting categorical features. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8154 LNAI, pp. 331–342). https://doi.org/10.1007/978-3-642-40669-0_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free