NEC: A hierarchical agglomerative clustering based on fisher and negentropy information

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a hierarchical agglomerative clustering is introduced. A hierarchy of two unsupervised clustering algorithms is considered. The first algorithm is based on a competitive Neural Network or on a Probabilistic Principal Surfaces approach and the second one on an agglomerative clustering based on both Fisher and Negentropy information. Different definitions of Negentropy information are used and some tests on complex synthetic data are presented. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Ciaramella, A., Longo, G., Staiano, A., & Tagliaferri, R. (2006). NEC: A hierarchical agglomerative clustering based on fisher and negentropy information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3931 LNCS, pp. 49–56). https://doi.org/10.1007/11731177_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free