Sciweavers

2223 search results - page 111 / 445
» Implicit Online Learning
Sort
View
NIPS
2004
15 years 6 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
ICML
2003
IEEE
16 years 5 months ago
Online Feature Selection using Grafting
In the standard feature selection problem, we are given a fixed set of candidate features for use in a learning problem, and must select a subset that will be used to train a mode...
Simon Perkins, James Theiler
142
Voted
ALT
2007
Springer
15 years 11 months ago
Online Regression Competitive with Changing Predictors
This paper deals with the problem of making predictions in the online mode of learning where the dependence of the outcome yt on the signal xt can change with time. The Aggregating...
Steven Busuttil, Yuri Kalnishkan
171
Voted
COLT
2005
Springer
15 years 6 months ago
Loss Bounds for Online Category Ranking
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
Koby Crammer, Yoram Singer
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
15 years 11 months ago
Online Education in Computer and Digital Forensics: A Case Study
Computer forensics is a relatively new, but growing, field of study at the undergraduate college and university level. This paper describes some of the course design aspects of te...
Gary C. Kessler