Sciweavers

6095 search results - page 19 / 1219
» Learning in Local Search
Sort
View
AI
2008
Springer
13 years 8 months ago
An experimental evaluation of simplicity in rule learning
While recent research on rule learning has focussed largely on finding highly accurate hypotheses, we evaluate the degree to which these hypotheses are also simple, that is small....
Ulrich Rückert, Luc De Raedt
ACSW
2004
13 years 10 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
ICML
2007
IEEE
14 years 9 months ago
Best of both: a hybridized centroid-medoid clustering heuristic
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
Nizar Grira, Michael E. Houle
ECCV
2010
Springer
13 years 12 months ago
Recursive Coarse-to-Fine Localization for fast Object Detection
Cascading techniques are commonly used to speed-up the scan of an image for object detection. However, cascades of detectors are slow to train due to the high number of detectors a...
Marco Pedersoli, Jordi Gonzàlez, Andrew D. Bagdan...
ML
2006
ACM
142views Machine Learning» more  ML 2006»
13 years 8 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....