Andere Kunden interessierten sich auch für
![Advances in Self-Organizing Maps and Learning Vector Quantization]( "Advances in Self-Organizing Maps and Learning Vector Quantization")
Advances in Self-Organizing Maps and Learning Vector Quantization110,99 €![Advances in Self-Organizing Maps and Learning Vector Quantization]( "Advances in Self-Organizing Maps and Learning Vector Quantization")
Advances in Self-Organizing Maps and Learning Vector Quantization161,99 €![Unsupervised feature analysis for high dimensional big data]( "Unsupervised feature analysis for high dimensional big data")
Unsupervised feature analysis for high dimensional big data40,99 €![Robust Feature Space Optimization and Noise Removal from PCG]( "Robust Feature Space Optimization and Noise Removal from PCG")
Robust Feature Space Optimization and Noise Removal from PCG23,99 €![Optimized Thresholding on Self Organizing Map for Cluster Analysis]( "Optimized Thresholding on Self Organizing Map for Cluster Analysis")
Optimized Thresholding on Self Organizing Map for Cluster Analysis38,99 €![On the Duality Feature of NP Complete Problems and Their Opt-Solutions]( "On the Duality Feature of NP Complete Problems and Their Opt-Solutions")
On the Duality Feature of NP Complete Problems and Their Opt-Solutions40,99 €![Reverse Engineering Feature Models]( "Reverse Engineering Feature Models")
Reverse Engineering Feature Models45,99 €
Self Organizing Map SOM is one of the wide spread neural network approaches which enable feature extraction, visualization in pattern recognition and data mining problems. However, two major problems have been observed when SOM is used in high dimensional feature space problems: the recognition rate is dropped when unseen data are used, and expensive computational cost when using large data sets. In this book, we develop new hierarchical search algorithm for SOM. Several experiments are conducted for some pattern recognition applications showed the superiority of the proposed SOM over traditional SOM and other related approaches.