Sciweavers

569 search results - page 10 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
ICPR
2002
IEEE
15 years 11 months ago
Context-Sensitive Bayesian Classifiers and Application to Mouse Pressure Pattern Classification
In this paper, we propose a new context-sensitive Bayesian learning algorithm. By modeling the distributions of data locations by a mixture of Gaussians, the new algorithm can uti...
Yuan (Alan) Qi, Rosalind W. Picard
FOCM
2006
50views more  FOCM 2006»
14 years 9 months ago
Online Learning Algorithms
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...
Steve Smale, Yuan Yao
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
15 years 2 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
IRMA
2000
14 years 11 months ago
Recognizing bounds of context change in on-line learning
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
WWW
2009
ACM
15 years 10 months ago
Matchbox: large scale online bayesian recommendations
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
David H. Stern, Ralf Herbrich, Thore Graepel