DocumentCode :
3250598
Title :
Unsupervised and supervised data clustering with competitive neural networks
Author :
Buhmann, Jochim ; Kühnel, Hans
Author_Institution :
Lawrence Livermore Nat. Lab., CA, USA
Volume :
4
fYear :
1992
fDate :
7-11 Jun 1992
Firstpage :
796
Abstract :
The authors discuss objective functions for unsupervised and supervised data clustering and the respective competitive neural networks which implement these clustering algorithms. They propose a cost function for unsupervised and supervised data clustering which comprises distortion costs, complexity costs and supervision costs. A maximum entropy estimation of the clustering cost function yields an optimal number of clusters, their positions and their cluster probabilities. A three-layer neural network with a winner-take-all connectivity in the clustering layer implements the proposed algorithm
Keywords :
computational complexity; feedforward neural nets; pattern recognition; unsupervised learning; cluster probabilities; competitive neural networks; complexity costs; distortion costs; maximum entropy estimation; supervised data clustering; supervision costs; three-layer neural network; unsupervised data clustering; winner-take-all connectivity; Clustering algorithms; Computer networks; Constraint optimization; Cost function; Entropy; Information processing; Neural networks; Physics computing; Prototypes; Yield estimation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1992. IJCNN., International Joint Conference on
Conference_Location :
Baltimore, MD
Print_ISBN :
0-7803-0559-0
Type :
conf
DOI :
10.1109/IJCNN.1992.227220
Filename :
227220
Link To Document :
بازگشت