Sciweavers

222 search results - page 9 / 45
» Learning Optimal Parameters in Decision-Theoretic Rough Sets
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 7 days ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter
CIA
2006
Springer
14 years 9 days ago
Learning to Negotiate Optimally in Non-stationary Environments
Abstract. We adopt the Markov chain framework to model bilateral negotiations among agents in dynamic environments and use Bayesian learning to enable them to learn an optimal stra...
Vidya Narayanan, Nicholas R. Jennings
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 7 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
DATAMINE
2006
166views more  DATAMINE 2006»
13 years 8 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis