Sciweavers

888 search results - page 4 / 178
» Learning to Select a Ranking Function
Sort
View
CIKM
2009
Springer
15 years 9 months ago
Enabling multi-level relevance feedback on pubmed by integrating rank learning into DBMS
Background: Finding relevant articles from PubMed is challenging because it is hard to express the user’s specific intention in the given query interface, and a keyword query ty...
Hwanjo Yu, Taehoon Kim, Jinoh Oh, Ilhwan Ko, Sungc...
121
Voted
ICML
2004
IEEE
15 years 8 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker
202
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 2 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
PKDD
2004
Springer
155views Data Mining» more  PKDD 2004»
15 years 8 months ago
Ensemble Feature Ranking
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Sele...
Kees Jong, Jérémie Mary, Antoine Cor...
128
Voted
WSDM
2012
ACM
214views Data Mining» more  WSDM 2012»
13 years 10 months ago
Selecting actions for resource-bounded information extraction using reinforcement learning
Given a database with missing or uncertain content, our goal is to correct and fill the database by extracting specific information from a large corpus such as the Web, and to d...
Pallika H. Kanani, Andrew K. McCallum