Gaussian hierarchical Bayesian clustering Algorithm

Rafael Eduardo Ruviaro Christ, Edwin Villanueva Talavera, Carlos Dias Maciel

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

Abstract

This paper presents the Gaussian Hierarchical Bayesian Clustering algorithm (GHBC). A new method for agglomerative hierarchical clustering derived from the HBC algorithm. GHBC has several advantages over traditional agglomerative algorithms. (1) It reduces the limitations due time and memory complexity. (2) It uses a bayesian posterior probability criterion to decide on merging clusters (modeling clusters as Gaussian distributions) rather than ad-hoc distance metrics. (3) It automatically finds the partition that most closely matches the data using Bayesian Information Criterion (BIC). Finally, experimental results on synthetic and real data show that GHBC can cluster data as the best classical agglomerative andpartitional algorithms.

Original languageEnglish
Title of host publicationProceedings of The 7th International Conference on Intelligent Systems Design and Applications, ISDA 2007
Pages133-137
Number of pages5
DOIs
StatePublished - 2007
Externally publishedYes
Event7th International Conference on Intelligent Systems Design and Applications, ISDA'07 - Rio de Janeiro, Brazil
Duration: 22 Oct 200724 Oct 2007

Publication series

NameProceedings of The 7th International Conference on Intelligent Systems Design and Applications, ISDA 2007

Conference

Conference7th International Conference on Intelligent Systems Design and Applications, ISDA'07
Country/TerritoryBrazil
CityRio de Janeiro
Period22/10/0724/10/07

Fingerprint

Dive into the research topics of 'Gaussian hierarchical Bayesian clustering Algorithm'. Together they form a unique fingerprint.

Cite this