Sciweavers

2027 search results - page 43 / 406
» Learning and Generalization with the Information Bottleneck
Sort
View
MLG
2007
Springer
15 years 4 months ago
Graphs, Hypergraphs, and Inductive Logic Programming
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
Hendrik Blockeel, Tijn Witsenburg, Joost N. Kok
KCAP
2005
ACM
15 years 3 months ago
Knowledge transfer via advice taking
We present a framework for knowledge transfer from one reinforcement learning task to a related task through advicetaking mechanisms. We discuss the importance of transfer in comp...
Lisa Torrey, Trevor Walker, Jude W. Shavlik, Richa...
ICML
2010
IEEE
14 years 11 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
SIGIR
2011
ACM
14 years 19 days ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
SIGIR
1999
ACM
15 years 2 months ago
Information Retrieval as Statistical Translation
We propose a new probabilistic approach to information retrieval based upon the ideas and methods of statistical machine translation. The central ingredient in this approach is a ...
Adam L. Berger, John D. Lafferty