Expectation-MiniMax approach to clustering analysis

Yiu Ming CHEUNG*

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingChapterpeer-review

Abstract

This paper proposes a general approach named Expectation-MiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Expectation-Maximization (EM) algorithm by an approximate one with a designable error term. Through adaptively minimizing a specific error term meanwhile maximizing the approximate contrast function, the EMM automatically penalizes all rivals during the competitive learning. Subsequently, the EMM not only includes the Rival Penalized Competitive Learning algorithm (Xu et al. 1993) and its Type A form (Xu 1997) with the new variants developed, but also provides a better alternative way to optimize the EM contrast function with at least two advantages: (1) faster model parameter learning speed, and (2) automatic model-complexity selection capability. We present the general learning procedures of the EMM, and demonstrate its outstanding performance in comparison with the EM.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsOkyay Kaynak, Ethem Alpaydin, Erkki Oja, Lei Xu
PublisherSpringer Verlag
Pages165-172
Number of pages8
ISBN (Print)3540404082, 9783540404088
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2714
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Scopus Subject Areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Expectation-MiniMax approach to clustering analysis'. Together they form a unique fingerprint.

Cite this