Sciweavers

2033 search results - page 60 / 407
» Ranking on Data Manifolds
Sort
View
IPM
2006
252views more  IPM 2006»
13 years 7 months ago
Automatic ranking of information retrieval systems using data fusion
Measuring effectiveness of information retrieval (IR) systems is essential for research and development and for monitoring search quality in dynamic environments. In this study, w...
Rabia Nuray, Fazli Can
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 8 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
ICPR
2004
IEEE
14 years 8 months ago
Compact Representation of Multidimensional Data Using Tensor Rank-One Decomposition
This paper presents a new approach for representing multidimensional data by a compact number of bases. We consider the multidimensional data as tensors instead of matrices or vec...
Hongcheng Wang, Narendra Ahuja
SIGIR
2009
ACM
14 years 2 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
CIKM
2008
Springer
13 years 9 months ago
Are click-through data adequate for learning web search rankings?
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...