R.Fagin, R.Kumar, M.Mahdian, D.Sivakumar, and E.Vee. Comparing and aggregating rankings with ties. PODS, 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Link Analysis Ranking Algorithms Theory And Experiments - Borodin, Roberts.. (2004) (Correct)
....so that they takes values in [0, 1] We will use the weak rank distance when we want to argue about two LAR vectors being far apart, and the strict rank distance when we want to argue about two LAR vectors being close. The problem of comparing partial rankings is studied independently in [52] and [19], where they discuss about the properties of Kendal tau distance on partial rankings. It is shown that the d r distance measure is a metric. Also, Fagin et al. [19] generalize other distance measures for the case of partial rankings. 4.4 Similarity of LAR algorithms We now turn to the problem ....
....we want to argue about two LAR vectors being close. The problem of comparing partial rankings is studied independently in [52] and [19] where they discuss about the properties of Kendal tau distance on partial rankings. It is shown that the d r distance measure is a metric. Also, Fagin et al. [19] generalize other distance measures for the case of partial rankings. 4.4 Similarity of LAR algorithms We now turn to the problem of comparing two LAR algorithms. We first give the following generic definition of similarity of two LAR algorithms, for any distance function d, and any ....
R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing and aggregating rankings with ties, 2003. To appear. 46
Building an Open Source Meta-Search Engine - Gulli, Signorini (2005) (Correct)
No context found.
R.Fagin, R.Kumar, M.Mahdian, D.Sivakumar, and E.Vee. Comparing and aggregating rankings with ties. PODS, 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC