Sciweavers

75 search results - page 2 / 15
» Phase transition and heuristic search in relational learning
Sort
View
ILP
2007
Springer
14 years 5 months ago
A Phase Transition-Based Perspective on Multiple Instance Kernels
: This paper is concerned with relational Support Vector Machines, at the intersection of Support Vector Machines (SVM) and relational learning or Inductive Logic Programming (ILP)...
Romaric Gaudel, Michèle Sebag, Antoine Corn...
GECCO
2008
Springer
142views Optimization» more  GECCO 2008»
13 years 12 months ago
Complexity of Max-SAT using stochastic algorithms
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
Mohamed Qasem, Adam Prügel-Bennett
AIPS
2008
14 years 1 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
ICML
2002
IEEE
14 years 11 months ago
Pruning Improves Heuristic Search for Cost-Sensitive Learning
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
Valentina Bayer Zubek, Thomas G. Dietterich
CEC
2010
IEEE
13 years 12 months ago
Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem
A hyper-heuristic performs search over a set of other search mechanisms. During the search, it does not require any problem-dependent data. This structure makes hyperheuristics pro...
Mustafa Misir, Katja Verbeeck, Patrick De Causmaec...