Sciweavers

174 search results - page 13 / 35
» Advances in Instance Selection for Instance-Based Learning A...
Sort
View
COR
2008
88views more  COR 2008»
14 years 9 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
ICML
2005
IEEE
15 years 10 months ago
Combining model-based and instance-based learning for first order regression
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
Kurt Driessens, Saso Dzeroski
FLAIRS
2008
14 years 11 months ago
Selecting Minority Examples from Misclassified Data for Over-Sampling
We introduce a method to deal with the problem of learning from imbalanced data sets, where examples of one class significantly outnumber examples of other classes. Our method sel...
Jorge de la Calleja, Olac Fuentes, Jesús Go...
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 1 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
GECCO
2006
Springer
214views Optimization» more  GECCO 2006»
15 years 1 months ago
A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set
Many data mining applications involve the task of building a model for predictive classification. The goal of such a model is to classify examples (records or data instances) into...
Elon S. Correa, Alex Alves Freitas, Colin G. Johns...