English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Fast Pattern Selection Algorithm for Support Vector Classifiers: "Time Complexity Analysis"

MPS-Authors
There are no MPG-Authors available
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Shin, H., & Cho, S. (2003). Fast Pattern Selection Algorithm for Support Vector Classifiers: "Time Complexity Analysis". In J. Liu, Y.-M. Cheung, & H. Yin (Eds.), Intelligent Data Engineering and Automated Learning: 4th International Conference, IDEAL 2003, Hong Kong, China, March 21-23, 2003 (pp. 1008-1015). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-DBB3-9
Abstract
Training SVM requires large memory and long cpu time when the pattern set is large. To alleviate the computational burden in SVM training, we propose a fast preprocessing algorithm which selects only the patterns near the decision boundary. The time complexity of the proposed algorithm is much smaller than that of the naive M^2 algorithm