Sciweavers

711 search results - page 75 / 143
» An Empirical Comparison of Selection Methods in Evolutionary...
Sort
View
GECCO
2008
Springer
163views Optimization» more  GECCO 2008»
14 years 11 months ago
Embedded evolutionary multi-objective optimization for worst case robustness
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
Gideon Avigad, Jürgen Branke
SAC
2006
ACM
15 years 3 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
ICPR
2004
IEEE
15 years 11 months ago
Selective Sampling Based on the Variation in Label Assignments
In this paper, a new selective sampling method for the active learning framework is presented. Initially, a small training set ? and a large unlabeled set ? are given. The goal is...
Piotr Juszczak, Robert P. W. Duin
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
15 years 4 months ago
Techniques for highly multiobjective optimisation: some nondominated points are better than others
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much e...
David W. Corne, Joshua D. Knowles
ICML
2010
IEEE
14 years 11 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...