Clustering using Renyi's Entropy (2003)
by
Robert Jenssen
,
Kenneth E. Hild II
,
Deniz Erdogmus
,
Jose C. Principe
,
Torbjørn Eltoft
| Venue: | IN PROCEEDING OF INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Jenssen03clusteringusing,
author = {Robert Jenssen and Kenneth E. Hild II and Deniz Erdogmus and Jose C. Principe and Torbjørn Eltoft},
title = {Clustering using Renyi's Entropy},
booktitle = {IN PROCEEDING OF INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS},
year = {2003},
pages = {523--528},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We propose a new clustering algorithm using Renyi's entropy as our similarity metric. The main idea is to assign a data pattern to the cluster, which among all possible clusters, increases its within-cluster entropy the least, upon inclusion of the pattern. We refer to this procedure as differential entropy clustering. Not knowing the true
