DocumentCode :
3317514
Title :
Self-organizing map as a probability density model
Author :
Kostiainen, Timo ; Lampinen, Jouko
Author_Institution :
Lab. of Comput. Eng., Helsinki Univ. of Technol., Espoo, Finland
Volume :
1
fYear :
2001
fDate :
2001
Firstpage :
394
Abstract :
The self-organizing map (SOM) is a widely used tool in exploratory data analysis. A major drawback of SOM has been the lack of a theoretically justified criterion for model selection. Model complexity has a decisive effect on the reliability of visual analysis, which is a main application of SOM. In particular, independence of variables cannot be observed unless generalization of the model is good. We describe the maximum likelihood probability density model which follows from the SOM training rule, and show how the density model can be applied to choosing the correct model complexity, based on the method of maximum likelihood
Keywords :
generalisation (artificial intelligence); learning (artificial intelligence); maximum likelihood estimation; probability; self-organising feature maps; generalization; learning rules; maximum likelihood estimation; model complexity; model selection; probability density model; self-organizing map; Data analysis; Data mining; Inference algorithms; Laboratories; Maximum likelihood estimation; Multidimensional systems; Noise measurement; Probability; Topology; Training data;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 2001. Proceedings. IJCNN '01. International Joint Conference on
Conference_Location :
Washington, DC
ISSN :
1098-7576
Print_ISBN :
0-7803-7044-9
Type :
conf
DOI :
10.1109/IJCNN.2001.939052
Filename :
939052
Link To Document :
بازگشت