Heuristic and optimization approaches to extending the Kohonen self organizing algorithm

DOI10.1016/0377-2217(96)00033-1zbMath0912.90211MaRDI QIDQ1268187

Mohamed A. Nour, Gregory R. Madey

Publication date: 18 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(96)00033-1

zbMATH Keywords

survey; classification; learning; data clustering; Kohonen self-organizing neural network

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

68T05: Learning and adaptive systems in artificial intelligence

90B99: Operations research and management science

Related Items

A Monte Carlo evaluation of the moving method, \(k\)-means and two self-organising neural networks, Segmentation-based competitive analysis with MULTICLUS and topology representing networks

Uses Software

• SOM_PAK

Cites Work

• Unnamed Item
• A study of the application of Kohonen-type neural networks to the travelling salesman problem
• Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
• Convergence properties of Kohonen's topology conserving maps: Fluctuations, stability, and dimension selection
• Neocognition: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position
• Self-organized formation of topologically correct feature maps
• Determining market response functions by neural network modeling: A comparison to econometric techniques
• Adaptive pattern classification and universal recoding. I: Parallel development and coding of neural feature detectors
• Mathematical theory on formation of category detecting nerve cells
• An improved neural network leader algorithm for part-machine grouping in group technology
• Neural network techniques for monotonic nonlinear models
• Field theory of self-organizing neural nets
• A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• An Algorithm for Finding Nearest Neighbors
• Printer graphics for clustering
• A Technique to Identify Nearest Neighbors
• An Algorithm for Finding Best Matches in Logarithmic Expected Time