The impact of ranker quality on rank aggregation algorithms: Information vs. robustness

ICDEW 2006 - Proceedings of the 22nd International Conference on Data Engineering Workshops

Volumn , Issue , 2006, Pages 37-

  Adali, Sibel ^a   Hill, Brandeis ^a   Magdon Ismail, Malik ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV CHAINS; TECHNICAL PRESENTATIONS;

AGGREGATION METHODS; EXPERIMENTAL EVALUATION; GROUND TRUTH; NOISE LEVELS; RANK AGGREGATION; RELATIVE PERFORMANCE; STATISTICAL FRAMEWORK;

AGGREGATES;

EID: 78650523315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2006.146     Document Type: Conference Paper

References (15)

1. M. M. S. Beg and N. Ahmad. Soft computing techniques for rank aggregation on the world wide web. World Wide Web: Internet and Web information Systems, 6(1):5-22, 2003.
2. C. M. Bishop. Neural Networks for Pattern Recognition. Clarendon Press, Oxford, 1995.
3. J. C. Borda. Mémoire sur les élections au scrutin. In Histoire de l'Académie Royale des Sciences, 1781.
4. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proceedings of ACM WWW, pages 107-117, 1998.
5. F. Y. L. Chin, X. Deng, Q. Fang, and S. Zhu. Approximate and dynamic rank aggregation. Theoretical Computer Science, 325(3):409-424, 2004.
6. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proceedings of ACM WWW, pages 613-622, 2001.
7. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing and aggregating rankings with ties. In Proceedings of ACM PODS, pages 47-58, 2004.
8. R. Fagin, R. Kumar, and D. Sivakumar. Comparing top k lists. SIAM J. Discrete Mathematics, 17(1):134-160, 2003.
9. R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In Proceedings of ACM SIGMOD, pages 301-312, 2003.
10. T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of ACM SIGKDD, pages 133-142, 2002.
11. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal, 49(1):291-307, 1970.
12. Y. Lu, W. Meng, L. Shu, C. Yu, and K.-L. Liu. Evaluation of result merging strategies for metasearch engines. In Proceedings of the 6th international Conference on Web Information Systems Engineering (WISE), 2005.
13. M. E. Renda and U. Straccia. Web metasearch: Rank vs. score based rank aggregation methods. In Proceedings of ACM SAC, pages 841-846, 2003.
14. D. Saari. Basic Geometry of Voting. Springer-Verlag, 1995.
15. B. Yuwono and D. L. Lee. Server ranking for distributed text retrieval systems on the internet. In Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA), pages 41-50, 1997.