Building a Sparse Kernel Classifier on Riemannian Manifold
It is difficult to deal with large datasets by kernel based methods since the number of basis functions required for an optimal solution equals the number of samples. We present an approach to build a sparse kernel classifier by adding constraints to the number of support vectors and to the classifier function. The classifier is considered on Riemannian manifold. And the sparse greedy learning algorithm is used to solve the formulated problem. Experimental results over several classification benchmarks show that the proposed approach can reduce the training and runtime complexities of kernel classifier applied to large datasets without scarifying high classification accuracy.
KeywordsSupport Vector Machine Support Vector Riemannian Manifold Relevance Vector Machine Machine Learn Research
Unable to display preview. Download preview PDF.
- 1.Burges, C.J.C.: Simplified support vector decision rules. In: Proc. 13th International Conference on Machine Learning, pp. 71–77. Morgan Kaufmann, San Francisco (1996)Google Scholar
- 4.Lee, Y.J., Mangasarian, O.L.: RSVM: reduced support vector machines. In: CD Proceedings of the First SIAM International Conference on Data Mining, Chicago (2001)Google Scholar
- 5.Wu, M., Scholkopf, B., Bakir, G.: Building sparse large margin classifiers. In: Proceedings of the 22th International Conference on Machine Learning, Bonn, Germany (2005)Google Scholar
- 7.Smola, A.J., Scholkopf, B.: Sparse greedy matrix approximation for machine learning. In: Proceedings of the 17th International Conference on Machine Learning, pp. 911–918. Morgan Kaufmann, San Francisco (2000)Google Scholar
- 10.The repository at: http://ida.first.gmd.de/~raetsch/