Robust clustering algorithms based on finite mixtures of multivariate t distribution

Chengwen Yu, Zhang Qianjin, Lei Guo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Providing protection against outlier in clustering data is a difficult problem. We proposed two robust clustering algorithms which integrate two modified versions of EM algorithm for mixtures t model with a model selection criterion respectively. The proposed methods can select the number of clusters component automatically by a combined component annihilation strategy and can also avoid the drawbacks of traditional mixture-based clustering algorithms - highly dependent on initialization and may converge to the boundary of the parameter space [7]. Experiment results show the contrast among different algorithms and demonstrate the effectiveness of our algorithms.

Original languageEnglish
Title of host publicationAdvances in Natural Computation - Second International Conference, ICNC 2006, Proceedings,
PublisherSpringer Verlag
Pages606-609
Number of pages4
ISBN (Print)3540459014, 9783540459019
DOIs
StatePublished - 2006
Event2nd International Conference on Natural Computation, ICNC 2006 - Xi'an, China
Duration: 24 Sep 200628 Sep 2006

Publication series

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

Conference

Conference2nd International Conference on Natural Computation, ICNC 2006
Country/TerritoryChina
CityXi'an
Period24/09/0628/09/06

Fingerprint

Dive into the research topics of 'Robust clustering algorithms based on finite mixtures of multivariate t distribution'. Together they form a unique fingerprint.

Cite this