Sciweavers

3395 search results - page 74 / 679
» Learning to efficiently rank
Sort
View
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 9 months ago
The TopX DB&IR engine
This paper proposes a demo of the TopX search engine, an extensive framework for unified indexing, querying, and ranking of large collections of unstructured, semistructured, and ...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 9 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
JUCS
2010
217views more  JUCS 2010»
13 years 7 months ago
The 3A Personalized, Contextual and Relation-based Recommender System
Abstract: This paper discusses the 3A recommender system that targets CSCL (computersupported collaborative learning) and CSCW (computer-supported collaborative work) environments....
Sandy El Helou, Christophe Salzmann, Denis Gillet
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
14 years 9 months ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
WWW
2010
ACM
13 years 9 months ago
Classification-enhanced ranking
Many have speculated that classifying web pages can improve a search engine's ranking of results. Intuitively results should be more relevant when they match the class of a q...
Paul N. Bennett, Krysta Marie Svore, Susan T. Duma...