Abstract
This paper proposes a new search strategy using imitative scale chaos optimization algorithm (MSCO) for model selection of support vector machine (SVM). It searches the parameter space of SVM with a very high efficiency and finds the optimum parameter setting for a practical classification problem with very low time cost. To demonstrate the performance of the proposed method it is applied to model selection of SVM in ultrasonic flaw classification and compared with grid search for model selection. Experimental results show that MSCO is a very powerful tool for model selection of SVM, and outperforms grid search in search speed and precision in ultrasonic flaw classification.
Similar content being viewed by others
References
Cristianini N, Shawe-Taylor J. An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods[M]. Cambridge University Press, England, 2000.
Hsu C W, Chang C C, Lin C J. A practical guide to support vector classification. 2003.
Cristianini N, Campbell C, Shawe-Taylor J. Dynamically Adapting Kernels in Support Vector Machines[R]. Technical Report, NC2-TR-1998-017, NeuroCOLT2, 1998.
Chung K M, Kao W C, Sun C L, et al. Radius margin bounds for support vector machines with the rbf kernel[J]. Neural Computation, 2003, 7(1):70–78.
Keerthi S S, Lin C J. Asymptotic behaviors of support vector machines with Gaussian kernel[J]. Neural Computation, 2003, 15(3): 1667–1689.
Zhang Tong, Wang Hong-wei, Wang Zi-cai, Mutative scale chaos optimization algorithm and its application [J]. Control and Decision. 1999, 14(3): 285–288 (in Chinese).
Wickerhauser M V. Adaptive Wavelet Analysis from Theory to Software[M]. Welleysley, MA, 1994.
Author information
Authors and Affiliations
Additional information
Project supported by National High-Technology Research and Development Program of China (Grant No. 863-2001AA602021)
About this article
Cite this article
Liu, Qk., Que, Pw., Fei, Cg. et al. Model selection for svm using imitative scale chaos optimization algorithm. J. of Shanghai Univ. 10, 531–534 (2006). https://doi.org/10.1007/s11741-006-0052-3
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11741-006-0052-3