Sciweavers

42 search results - page 2 / 9
» Simple Rules for Low-Knowledge Algorithm Selection
Sort
View
PKDD
2007
Springer
121views Data Mining» more  PKDD 2007»
13 years 11 months ago
Improved Algorithms for Univariate Discretization of Continuous Features
In discretization of a continuous variable its numerical value range is divided into a few intervals that are used in classification. For example, Na¨ıve Bayes can benefit from...
Jussi Kujala, Tapio Elomaa
ICARIS
2003
Springer
13 years 10 months ago
An Investigation of the Negative Selection Algorithm for Fault Detection in Refrigeration Systems
Supermarkets lose millions of pounds every year through lost trading and stock wastage caused by the failure of refrigerated cabinets. Therefore, a huge commercial market exists fo...
Dan W. Taylor, David Corne
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 5 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
CP
2006
Springer
13 years 9 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
NIPS
2004
13 years 6 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...