arrow
Return

Using evolutionary algorithms for model-based clustering

delete2013-07-01
delete17
PRE
AI
J
Jeffrey L. Andrews *
P
Paul D. McNicholas
DOI:10.1016/j.patrec.2013.02.008delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In mixture model-based clustering, parameter estimation is generally carried out using the expectation-maximization algorithm, or some closely related variant. We present a new approach by casting the model-fitting problem as a single-objective evolutionary algorithm that focuses on searching the cluster-membership space. The appeal of an evolutionary algorithm is its ability to more thoroughly search the parameter space, providing an approach inherently more robust with respect to local maxima. This approach is illustrated through application to both simulated and real clustering data sets where comparisons are drawn with traditional model-fitting algorithms. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Cluster analysis
EM algorithm
Evolutionary algorithms
Finite mixture models
Model-based clustering

Journal

Pattern Recognition Letters cover
Pattern Recognition Letters
IF:
3.3
Papers:
7.8K
Citations:
1.6W

Organization

U
University of Guelph
Scholars:
1.3W
Papers: 1.2W
Citations: 1.7W