Sciweavers

176 search results - page 14 / 36
» Optimal Sample Selection for Batch-mode Reinforcement Learni...
Sort
View
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 1 months ago
Applying both positive and negative selection to supervised learning for anomaly detection
This paper presents a novel approach of applying both positive selection and negative selection to supervised learning for anomaly detection. It first learns the patterns of the n...
Xiaoshu Hang, Honghua Dai
ICML
2010
IEEE
13 years 8 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
SAC
2006
ACM
14 years 1 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
13 years 8 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
ALT
2008
Springer
14 years 4 months ago
Active Learning in Multi-armed Bandits
In this paper we consider the problem of actively learning the mean values of distributions associated with a finite number of options (arms). The algorithms can select which opti...
András Antos, Varun Grover, Csaba Szepesv&a...