Sparse Online Greedy Support Vector Regression
ECML '02 Proceedings of the 13th European Conference on Machine Learning
Exact simplification of support vector solutions
The Journal of Machine Learning Research
Online Passive-Aggressive Algorithms
The Journal of Machine Learning Research
The Forgetron: A Kernel-Based Perceptron on a Budget
SIAM Journal on Computing
Tracking the best hyperplane with a simple budget perceptron
COLT'06 Proceedings of the 19th annual conference on Learning Theory
A new perspective on an old perceptron algorithm
COLT'05 Proceedings of the 18th annual conference on Learning Theory
IEEE Transactions on Signal Processing
On the generalization ability of on-line learning algorithms
IEEE Transactions on Information Theory
Robust bounds for classification via selective sampling
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Identifying suspicious URLs: an application of large-scale online learning
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Polynomial to linear: efficient classification with conjunctive features
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
Tighter perceptron with improved dual use of cached data for model representation and validation
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Example-dependent basis vector selection for kernel-based classifiers
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Learning to detect malicious URLs
ACM Transactions on Intelligent Systems and Technology (TIST)
Double Updating Online Learning
The Journal of Machine Learning Research
Interactive labeling of WCE images
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Sparse Kernel-SARSA(λ) with an eligibility trace
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
A kernel-based Perceptron with dynamic memory
Neural Networks
An online framework for learning novel concepts over multiple cues
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part I
Online feature selection for mining big data
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
A kernel fused perceptron for the online classification of large-scale data
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Online Multiple Kernel Classification
Machine Learning
Large scale online kernel classification
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernel-based Perceptron for storing the online hypothesis is not bounded. Previous work has been focused on discarding part of the instances in order to keep the memory bounded. In the proposed algorithm the instances are not discarded, but projected onto the space spanned by the previous online hypothesis. We derive a relative mistake bound and compare our algorithm both analytically and empirically to the state-of-the-art Forgetron algorithm (Dekel et al, 2007). The first variant of our algorithm, called Projectron, outperforms the Forgetron. The second variant, called Projectron++, outperforms even the Perceptron.