Self-organizing maps and clustering methods for matrix data

DOI10.1016/j.neunet.2004.06.012zbMath1079.68598WikidataQ30976795 ScholiaQ30976795MaRDI QIDQ2485243

Klaus Obermayer, Sambu Seo

Publication date: 3 August 2005

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2004.06.012

zbMATH Keywords

Self-organizing maps; Co-occurrence data; Deterministic annealing; Growing network; Information bottleneck; Matrix data; Maximum entropy methods; Pairwise clustering; Rate distortion theory

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T10: Pattern recognition, speech recognition

Related Items

Batch and median neural gas, Fast algorithm and implementation of dissimilarity self-organizing maps, Granular self-organizing map (grSOM) for structure identification, Topographic Mapping of Large Dissimilarity Data Sets

Uses Software

• GTM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enlarging the region of convergence of Newton's method for constrained optimization
• Self-organized formation of topologically correct feature maps
• Analysis of a simple self-organizing process
• Self-organizing maps: Ordering, convergence properties and energy functions
• Theoretical aspects of the SOM algorithm
• Modern multidimensional scaling: theory and applications
• Clustering Based on Conditional Distributions in an Auxiliary Space
• Information Theory and Statistical Mechanics
• Vector quantization by deterministic annealing
• A Bayesian Analysis of Self-Organizing Maps
• Self-organizing maps.