Sciweavers

716 search results - page 46 / 144
» Optimizing Sorting with Machine Learning Algorithms
Sort
View
COLT
2004
Springer
15 years 7 months ago
Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
Nader H. Bshouty
GECCO
2008
Springer
232views Optimization» more  GECCO 2008»
15 years 3 months ago
An efficient SVM-GA feature selection model for large healthcare databases
This paper presents an efficient hybrid feature selection model based on Support Vector Machine (SVM) and Genetic Algorithm (GA) for large healthcare databases. Even though SVM an...
Rick Chow, Wei Zhong, Michael Blackmon, Richard St...
NIPS
2008
15 years 3 months ago
Optimization on a Budget: A Reinforcement Learning Approach
Many popular optimization algorithms, like the Levenberg-Marquardt algorithm (LMA), use heuristic-based "controllers" that modulate the behavior of the optimizer during ...
Paul Ruvolo, Ian R. Fasel, Javier R. Movellan
CORR
2006
Springer
130views Education» more  CORR 2006»
15 years 2 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
ECML
2007
Springer
15 years 8 months ago
Safe Q-Learning on Complete History Spaces
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
Stephan Timmer, Martin Riedmiller