Sciweavers

206 search results - page 28 / 42
» Learning Heuristic Functions from Relaxed Plans
Sort
View
CIKM
2000
Springer
15 years 2 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
TEC
2008
115views more  TEC 2008»
14 years 9 months ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
AADA
2011
13 years 9 months ago
Sparse Template-Based variational Image Segmentation
We introduce a variational approach to image segmentation based on sparse coverings of image domains by shape templates. The objective function combines a data term that achieves ...
Dirk Breitenreicher, Jan Lellmann, Christoph Schn&...
TSMC
1998
99views more  TSMC 1998»
14 years 9 months ago
Learning visually guided grasping: a test case in sensorimotor learning
Abstract—We present a general scheme for learning sensorimotor tasks which allows rapid on-line learning and generalization of the learned knowledge to unfamiliar objects. The sc...
Ishay Kamon, Tamar Flash, Shimon Edelman
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 4 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...