Sciweavers

390 search results - page 56 / 78
» A Model of Inductive Bias Learning
Sort
View
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 8 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
ILP
2007
Springer
14 years 2 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
SARA
2005
Springer
14 years 2 months ago
Learning Regular Expressions from Noisy Sequences
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
Ugo Galassi, Attilio Giordana
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
14 years 1 months ago
Simple Estimators for Relational Bayesian Classifiers
In this paper we present the Relational Bayesian Classifier (RBC), a modification of the Simple Bayesian Classifier (SBC) for relational data. There exist several Bayesian classif...
Jennifer Neville, David Jensen, Brian Gallagher
WWW
2009
ACM
14 years 9 months ago
A dynamic bayesian network click model for web search ranking
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...
Olivier Chapelle, Ya Zhang