Complexity selection of the self-organizing map

DOI10.1007/3-540-46084-5_150MaRDI QIDQ4706630zbMATH OpenFDO

Authors Anssi Lensu, Pasi Koikkalainen

Publication date 16 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2415/24150927.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• On the generative probability density model in the self-organizing map
• scientific article; zbMATH DE number 1406086
• A Pareto self-organizing map
• scientific article; zbMATH DE number 1017090
• Graph multidimensional scaling with self-organizing maps

Cited in

(2)

• Topology selection for self-organizing maps
• scientific article; zbMATH DE number 1841963 (Why is no real title available?)

This page was built for publication: Complexity selection of the self-organizing map

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706630)