nips nips2004 nips2004-34 nips2004-34-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Léon Bottou, Jason Weston, Gökhan H. Bakir
Abstract: We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure aims at creating a separable distribution of training examples with minimal impact on the position of the decision boundary. It breaks the linear dependency between the number of SVs and the number of training examples, and sharply reduces the complexity of SVMs during both the training and prediction stages. 1
Burges, C. J. C. (1996). Simplified Support Vector Decision Rules. In Saitta, L., editor, Proceedings of the 13th International Conference on Machine Learning, pages 71–77, San Mateo, CA. Morgan Kaufmann. Burges, C. J. C. (1998). A Tutorial on Support Vector Machines for Pattern Recognition. Data Mining and Knowledge Discovery, 2(2):121–167. Chang, C.-C. and Lin, C.-J. (2001). Training ν-Support Vector Classifiers: Theory and Algorithms. Neural Computation, 13(9):2119–2147. Devijver, P. and Kittler, J. (1982). Pattern Recogniton, A statistical approach. Prentice Hall, Englewood Cliffs. Downs, T., Gates, K. E., and Masters, A. (2001). Exact Simplification of Support Vector Solutions. Journal of Machine Learning Research, 2:293–297. Hart, P. (1968). The condensed nearest neighbor rule. IEEE Transasctions on Information Theory, 14:515–516. ¨ Joachims, T. (1999). Making Large–Scale SVM Learning Practical. In Sch olkopf, B., Burges, C. J. C., and Smola, A. J., editors, Advances in Kernel Methods — Support Vector Learning, pages 169–184, Cambridge, MA. MIT Press. Sch¨ lkopf, B. and Smola, A. J. (2002). Learning with Kernels. MIT Press, Cambridge, MA. o Steinwart, I. (2004). Sparseness of Support Vector Machines—Some Asymptotically Sharp Bounds. ¨ In Thrun, S., Saul, L., and Scholkopf, B., editors, Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA. Vapnik, V. N. (1995). The Nature of Statistical Learning Theory. Springer Verlag, New York. Wilson, D. L. (1972). Asymptotic properties of the nearest neighbor rules using edited data. IEEE Transactions on Systems, Man, and Cybernetics, 2:408–420.