Fast algorithm and implementation of dissimilarity self-organizing maps

DOI10.1016/j.neunet.2006.05.002zbMath1102.68540arXiv0709.3461OpenAlexW1964299421WikidataQ51939824 ScholiaQ51939824MaRDI QIDQ2506522

Brieuc Conan-Guez, Aïcha El Golli, Fabrice Rossi

Publication date: 10 October 2006

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

Full work available at URL: https://arxiv.org/abs/0709.3461

zbMATH Keywords

clusteringunsupervised learningself-organizing mapproximity datafast implementationdissimilarity datanonlinear projectionpairwise data

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

A novel data-driven visualization of \(n\)-dimensional feasible region using interpretable self-organizing maps (iSOM) ⋮ The new and computationally efficient MIL-SOM algorithm: potential benefits for visualization and analysis of a large-scale high-dimensional clinically acquired geographic data ⋮ Self-organizing hidden Markov model map (SOHMMM) ⋮ Self-organizing map for symbolic data

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained clustering and Kohonen self-organizing maps
• Self-organizing maps of symbol strings
• Self-organizing maps: Generalizations and new optimization techniques
• Classification, clustering, and data mining applications. Proceedings of the meeting of the International Federation of Classification Societies (IFCS), Chicago, IL, USA, July 15--18, 2004.
• Self-organizing maps and clustering methods for matrix data
• Self-organizing maps

This page was built for publication: Fast algorithm and implementation of dissimilarity self-organizing maps