Approximate and dynamic rank aggregation

Rank aggregation, originally an important issue in social choice theory, has become more and more important in information retrieval applications over the Internet, such as meta-search, recommendation system, etc. In this work, we consider an aggregation function using a weighted version of the normalized Kendall-τ distance. We propose a polynomial time approximation scheme, as well as a practical heuristic algorithm with the approximation ratio two for the NP-hard problem. In addition, we discuss issues and models for the dynamic rank aggregation problem.

[1]  Bernard Monjardet,et al.  The median procedure in cluster analysis and social choice theory , 1981, Math. Soc. Sci..

[2]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[3]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[4]  Adele E. Howe,et al.  Experiences with selecting search engines using metasearch , 1997, TOIS.

[5]  A. Guénoche,et al.  Median linear orders: Heuristics and a branch and bound algorithm , 1989 .

[6]  Xiaotie Deng,et al.  Metasearch via Voting , 2003, IDEAL.

[7]  Guijun Wang,et al.  ProFusion*: Intelligent Fusion from Multiple, Distributed Search Engines , 1996, J. Univers. Comput. Sci..

[8]  R. Graham,et al.  Spearman's Footrule as a Measure of Disarray , 1977 .

[9]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[10]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[11]  Marek Karpinski,et al.  Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..

[12]  Xiaotie Deng,et al.  Approximate sequencing for variable length tasks , 2003, Theor. Comput. Sci..

[13]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Clement T. Yu,et al.  Towards a highly-scalable and effective metasearch engine , 2001, WWW '01.

[15]  S. Shapiro,et al.  Mathematics without Numbers , 1993 .

[16]  M. Trick,et al.  Voting schemes for which it can be difficult to tell who won the election , 1989 .

[17]  Alain Guénoche,et al.  New results on the computation of median orders , 1997, Discret. Math..