AN OPTIMIZATION FOR CLASSIFICATION MAXIMUM-LIKELIHOOD CRITERION

Authors
Citation
Cs. Won, AN OPTIMIZATION FOR CLASSIFICATION MAXIMUM-LIKELIHOOD CRITERION, Pattern recognition letters, 14(5), 1993, pp. 363-367
Citations number
7
Categorie Soggetti
Computer Sciences, Special Topics","Computer Applications & Cybernetics
Journal title
ISSN journal
01678655
Volume
14
Issue
5
Year of publication
1993
Pages
363 - 367
Database
ISI
SICI code
0167-8655(1993)14:5<363:AOFCMC>2.0.ZU;2-8
Abstract
A clustering criterion introduced by Symons (1981), which is called Cl assification Maximum Likelihood (CML) criterion in this paper, is desi gned to consider the cluster size and the covariance structure of samp les. The CML criterion is optimized by the 'Moving method' suggested b y Duda and Hart (1973, p. 226). When the Moving method is applied to t he CML criterion with an arbitrary initial cluster, it often yields de generate clusters. To avoid such degenerate cases, we propose two stag es of clustering. In the first stage, we roughly partition samples wit h respect to 'the covariance structure component' in the CML criterion . The resulting partition is then further clustered with the full CML criterion.