Title
New aspects of the elastic net algorithm for cluster analysis
Date Issued
01 December 2009
Access level
metadata only access
Resource Type
conference paper
Author(s)
Lévano M.
Universidad Católica de Temuco
Abstract
The elastic net algorithm, formulated by Durbin-Willshaw as an heuristic method and initially applied to solve the travelling salesman problem, can be used as a tool for data clustering in n-dimensional space. With the help of statistical mechanics it can be formulated as an deterministic annealing method in which a chain of nodes interacts at different temperatures with the data cloud. From a given temperature on the nodes are found to be the optimal centroid's of fuzzy clusters, if the number of nodes is much smaller then number of data points. We show in this contribution that for this temperature the centroid's of hard clusters, defined by the nearest neighbor clusters of every node, are in the same position as the optimal centroid's of the fuzzy clusters. This result can be used as a stopping criterion for the annealing process. The stopping temperature and the number and size of the hard clusters depend on the number of nodes in the chain. Test were made with homogeneous and inhomogeneous artificial clusters in two dimensions. © 2009 Springer-Verlag.
Start page
281
End page
290
Volume
43 CCIS
Language
English
OCDE Knowledge area
Ciencias de la computación
Subjects
Scopus EID
2-s2.0-78049394986
Source
Communications in Computer and Information Science
Resource of which it is part
Communications in Computer and Information Science
ISSN of the container
18650929
ISBN of the container
978-364203968-3
Conference
11th International Conference on Engineering Applications of Neural Networks, EANN 2009
Sources of information:
Directorio de Producción Científica
Scopus