Tracking the Best Hyperplane with a Simple Budget
22/06/2006· When proving shifting bounds for kernel based classifiers, one also faces the problem of storing a number of support vectors that can grow unboundedly, unless an eviction policy is used to keep this number under control. In this paper, we show that shifting and on line learning on a budget canbined surprisingly well. First, we introduce






































