DocumentCode :
1241470
Title :
Comparing Scores Intended for Ranking
Author :
Bhamidipati, Narayan L. ; Pal, Sankar K.
Author_Institution :
Data Min. & Res. Group, Yahoo! Software Dev. India Pvt. Ltd., Bangalore
Volume :
21
Issue :
1
fYear :
2009
Firstpage :
21
Lastpage :
34
Abstract :
Often, ranking is performed on the the basis of some scores available for each item. The existing practice for comparing scoring functions is to compare the induced rankings by one of the multitude of rank comparison methods available in the literature. We suggest that it may be better to compare the underlying scores themselves. To this end, a generalized Kendall distance is defined, which takes into consideration not only the final ordering that the two schemes produce, but also at the spacing between pairs of scores. This is shown to be equivalent to comparing the scores after fusing with another set of scores, making it theoretically interesting. A top k version of the score comparison methodology is also provided. Experimental results clearly show the advantages score comparison has over rank comparison.
Keywords :
information retrieval; search engines; generalized Kendall distance; rank comparison method; scoring function; Data mining; Intersymbol interference; Machine intelligence; Correlation and regression analysis; Information Technology and Systems;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/TKDE.2008.111
Filename :
4538220
Link To Document :
بازگشت