A nonparametric information theoretic clustering algorithm

Lev Faivishevsky, Jacob Goldberger

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

57 Scopus citations

Abstract

In this paper we propose a novel clustering algorithm based on maximizing the mutual information between data points and clusters. Unlike previous methods, we neither assume the data axe given in terms of distributions nor impose any parametric model on the within-cluster distribution. Instead, we utilize a non-parametric estimation of the average cluster entropies and search for a clustering that maximizes the estimated mutual information between data points and clusters. The improved performance of the proposed algorithm is demonstrated on several standard datasets.

Original languageEnglish
Title of host publicationICML 2010 - Proceedings, 27th International Conference on Machine Learning
Pages351-358
Number of pages8
StatePublished - 2010
Event27th International Conference on Machine Learning, ICML 2010 - Haifa, Israel
Duration: 21 Jun 201025 Jun 2010

Publication series

NameICML 2010 - Proceedings, 27th International Conference on Machine Learning

Conference

Conference27th International Conference on Machine Learning, ICML 2010
Country/TerritoryIsrael
CityHaifa
Period21/06/1025/06/10

Fingerprint

Dive into the research topics of 'A nonparametric information theoretic clustering algorithm'. Together they form a unique fingerprint.

Cite this