Sciweavers

3395 search results - page 106 / 679
» Learning to efficiently rank
Sort
View
SIGIR
2008
ACM
14 years 11 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...
74
Voted
KDD
2004
ACM
112views Data Mining» more  KDD 2004»
16 years 9 days ago
A rank sum test method for informative gene discovery
Finding informative genes from microarray data is an important research problem in bioinformatics research and applications. Most of the existing methods rank features according t...
Lin Deng, Jian Pei, Jinwen Ma, Dik Lun Lee
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
16 years 1 days ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
15 years 4 months ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng
99
Voted
AAAI
2006
15 years 1 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer