Sciweavers

126 search results - page 1 / 26
» Improving heuristic mini-max search by supervised learning
Sort
View
AI
2002
Springer
13 years 4 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
ICML
2002
IEEE
14 years 5 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
ICDM
2005
IEEE
217views Data Mining» more  ICDM 2005»
13 years 10 months ago
Improving Automatic Query Classification via Semi-Supervised Learning
Accurate topical classification of user queries allows for increased effectiveness and efficiency in general-purpose web search systems. Such classification becomes critical if th...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...
ACL
2009
13 years 2 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
AAAI
2012
11 years 7 months ago
Ontological Smoothing for Relation Extraction with Minimal Supervision
Relation extraction, the process of converting natural language text into structured knowledge, is increasingly important. Most successful techniques use supervised machine learni...
Congle Zhang, Raphael Hoffmann, Daniel S. Weld