Cross Covering Algorithm Based on Simulated Annealing
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.
Structural machine learning methods Covering Algorithm Simulated Annealing
Zhang Yanping Liu Chao
School of Computer Science and Technology, Anhui University, Hefei, China
国际会议
2010 International Conference on Digital Manufacturing and Automation(2010 数字制造与自动化国际会议 ICDMA 2010)
长沙
英文
454-457
2010-12-18（万方平台首次上网日期，不代表论文的发表时间）