Sciweavers

3517 search results - page 65 / 704
» Online Learning with Queries
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 12 days ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li
JMLR
2002
140views more  JMLR 2002»
14 years 11 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
CI
2010
129views more  CI 2010»
14 years 12 months ago
On-Line Case-Based Planning
Some domains, such as real-time strategy (RTS) games, pose several challenges to traditional planning and machine learning techniques. In this paper, we present a novel on-line ca...
Santi Ontañón, Kinshuk Mishra, Neha ...
CIKM
2006
Springer
15 years 3 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
ECTEL
2007
Springer
15 years 6 months ago
Exploiting Preference Queries for Searching Learning Resources
While the growing number of learning resources increases the choice for learners, it also makes it more and more difficult to find suitable courses. Thus, improved search capabili...
Fabian Abel, Eelco Herder, Philipp Kärger, Da...