Cross Covering Algorithm Based on Simulated Annealing

Abstract

Structural machine learning method—covering algorithm (CA) possesses faster speed, lower complexity and higher precision. But construction of the weight of the neurons for new center of sphere domain is usually given a manmade criteria, could not follow the distribution of samples to achieve the optimal solution. In this paper, a new constructive algorithm which combines the cross covering algorithm and Simulated Annealing is presented. It gets the covering center according to the search of the simulated annealing theory. The results show that the algorithm can reduce the number of coverings with higher degree of recognition accuracy.

5 Figures and Tables

Cite this paper

@article{Yanping2010CrossCA, title={Cross Covering Algorithm Based on Simulated Annealing}, author={Zhang Yanping and Liu Chao}, journal={2010 International Conference on Digital Manufacturing & Automation}, year={2010}, volume={1}, pages={454-457} }