Sciweavers

119 search results - page 2 / 24
» Comparing the sensitivity of information retrieval metrics
Sort
View
SIGIR
2005
ACM
13 years 10 months ago
An exploration of axiomatic approaches to information retrieval
Existing retrieval models generally do not offer any guarantee for optimal retrieval performance. Indeed, it is even difficult, if not impossible, to predict a model’s empirica...
Hui Fang, ChengXiang Zhai
PR
2006
141views more  PR 2006»
13 years 4 months ago
Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
The performance of many supervised and unsupervised learning algorithms is very sensitive to the choice of an appropriate distance metric. Previous work in metric learning and ada...
Hong Chang, Dit-Yan Yeung, William K. Cheung
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
14 years 2 months ago
Towards Recency Ranking in Web Search
In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detect...
Anlei Dong, Yi Chang, Zhaohui Zheng, Gilad Mishne,...
PR
2006
164views more  PR 2006»
13 years 4 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
CVPR
2008
IEEE
14 years 7 months ago
Rank-based distance metric learning: An application to image retrieval
We present a novel approach to learn distance metric for information retrieval. Learning distance metric from a number of queries with side information, i.e., relevance judgements...
Jung-Eun Lee, Rong Jin, Anil K. Jain