Sciweavers

72 search results - page 3 / 15
» Learning Heuristic Functions through Approximate Linear Prog...
Sort
View
IJCNN
2006
IEEE
13 years 11 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
AAAI
1994
13 years 7 months ago
Improving Learning Performance Through Rational Resource Allocation
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
Jonathan Gratch, Steve A. Chien, Gerald DeJong
AI
2002
Springer
13 years 5 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
13 years 5 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
KI
2007
Springer
13 years 12 months ago
Inductive Synthesis of Recursive Functional Programs
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
Martin Hofmann 0008, Andreas Hirschberger, Emanuel...