2263 search results - page 79 / 453 » On learning in agent-centered search |
144
click to vote
UAI
2001
15 years 7 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
175
click to vote
ACL
2009
15 years 4 months ago
2009
Web search quality can vary widely across languages, even for the same information need. We propose to exploit this variation in quality by learning a ranking function on bilingua...
182
click to vote
CIKM
2009
Springer
16 years 23 days ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
181
click to vote
ICADL
2010
Springer
15 years 11 months ago
2010
Springer
Maintaining and extending large thesauri is an important challenge facing digital libraries and IT businesses alike. In this paper we describe a method building on and extending ex...
173
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Reinforcement learning deals with learning optimal or near optimal policies while interacting with the environment. Application domains with many continuous variables are difficul...