Sciweavers

11910 search results - page 214 / 2382
» Online Learning Algorithms
Sort
View
ICML
2003
IEEE
16 years 3 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
JMLR
2006
125views more  JMLR 2006»
15 years 3 months ago
Spam Filtering Using Statistical Data Compression Models
Spam filtering poses a special problem in text categorization, of which the defining characteristic is that filters face an active adversary, which constantly attempts to evade fi...
Andrej Bratko, Gordon V. Cormack, Bogdan Filipic, ...
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
15 years 9 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
ICDM
2003
IEEE
181views Data Mining» more  ICDM 2003»
15 years 8 months ago
Dynamic Weighted Majority: A New Ensemble Method for Tracking Concept Drift
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...
Jeremy Z. Kolter, Marcus A. Maloof
ESA
2007
Springer
131views Algorithms» more  ESA 2007»
15 years 9 months ago
Online Scheduling of Equal-Length Jobs on Parallel Machines
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de
Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, G...