A new clustering evaluation function using Renyi's information potential

Authors:
E. Gokcay;J. C. Principe
Affiliations:
Comput. Neuro Eng. Lab., Florida Univ., Gainesville, FL, USA;-
Venue:
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06
Year:
2000

Citing 0
Cited 5

Information Theoretic Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
STAVIES: A System for Information Extraction from Unknown Web Data Sources through Automatic Web Wrapper Generation Using Clustering Techniques

IEEE Transactions on Knowledge and Data Engineering
FL-LIMS: laboratory information management system as an intelligent system

ECC'08 Proceedings of the 2nd conference on European computing conference
Fuzzy unsupervised classification of multivariate time trajectories with the Shannon entropy regularization

Computational Statistics & Data Analysis
A novel ant-based clustering algorithm using Renyi entropy

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clustering is an important unsupervised learning paradigm, but so far the traditional methodologies are mostly based on the minimization of the variance between the data and the cluster means. Here we propose a new evaluation function based on a previously developed information theoretic measure defined from Renyi's (1960) entropy. We show how to apply Renyi's entropy to clustering and analyze the resulting staircase nature of the performance function that can be expected during learning. We suggest simulated annealing as a possible optimization criterion.