569 search results - page 9 / 114 » Online Bounds for Bayesian Algorithms |
SIGIR
2002
ACM
14 years 9 months ago
2002
ACM
This paper explores the use of Bayesian online classifiers to classify text documents. Empirical results indicate that these classifiers are comparable with the best text classifi...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
We combine Bayesian online change point detection with Gaussian processes to create a nonparametric time series model which can handle change points. The model can be used to loca...
NN
2002
Springer
14 years 9 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
SODA
1993
ACM
14 years 11 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.