Variable selection for clustering and classification

From MaRDI portal
Publication:288977

DOI10.1007/S00357-013-9139-2zbMATH Open1360.62310arXiv1303.5294OpenAlexW2075711194MaRDI QIDQ288977FDOQ288977


Authors: Jeffrey L. Andrews, Paul D. McNicholas Edit this on Wikidata


Publication date: 27 May 2016

Published in: Journal of Classification (Search for Journal in Brave)

Abstract: As data sets continue to grow in size and complexity, effective and efficient techniques are needed to target important features in the variable space. Many of the variable selection techniques that are commonly used alongside clustering algorithms are based upon determining the best variable subspace according to model fitting in a stepwise manner. These techniques are often computationally intensive and can require extended periods of time to run; in fact, some are prohibitively computationally expensive for high-dimensional data. In this paper, a novel variable selection technique is introduced for use in clustering and classification analyses that is both intuitive and computationally efficient. We focus largely on applications in mixture model-based learning, but the technique could be adapted for use with various other clustering/classification methods. Our approach is illustrated on both simulated and real data, highlighted by contrasting its performance with that of other comparable variable selection techniques on the real data sets.


Full work available at URL: https://arxiv.org/abs/1303.5294




Recommendations




Cites Work


Cited In (26)

Uses Software





This page was built for publication: Variable selection for clustering and classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288977)