Skip to main content
Conference Proceedings

Complexity selection of the self-organizing map

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2415 LNCS 927-932
DOI: 10.1007/3-540-46084-5_150
1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes how the complexity of the Self-Organizing Map can be selected using the Minimum Message Length principle. The use of the method in textual data analysis is also demonstrated. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Lensu, A., & Koikkalainen, P. (2002). Complexity selection of the self-organizing map. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2415 LNCS, pp. 927–932). Springer Verlag. https://doi.org/10.1007/3-540-46084-5_150

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