skip to main content
10.1145/371920.372165acmconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
Article

Rank aggregation methods for the Web

Authors Info & Claims
Published:01 April 2001Publication History
First page image

References

  1. 1.Search Engine Watch, www.searchenginewatch.comGoogle ScholarGoogle Scholar
  2. 2.Search Engine Watch article, www.searchenginewatch.com /sereport/00/11-inclusion.htmlGoogle ScholarGoogle Scholar
  3. 3.Metacrawler, www.metacrawler.comGoogle ScholarGoogle Scholar
  4. 4.K. Bharat and M. Henzinger. Improved algorithms for topic distillation in a hyperlinked environment. ACM SIGIR, pages 104-111, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.J. J. Bartholdi, C. A. Tovey, and M. A. Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6(2):157-165, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  6. 6.J. C. Borda. Memoire sur les elections au scrutin. Histoire de l'Academie Royale des Sciences, 1781.Google ScholarGoogle Scholar
  7. 7.S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks, 30(1-7):107-117, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.S. Chakrabarti, B. Dom, D. Gibson, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Experiments in topic distillation, Proc. ACM SIGIR Workshop on Hypertext Information Retrieval on the Web, 1998.Google ScholarGoogle Scholar
  9. 9.M.-J. Condorcet. Essai surl'application de l'analyse a la probabilitie des decisions rendues a la pluralite des voix, 1785.Google ScholarGoogle Scholar
  10. 10.A. H. Copeland. A reasonable social welfare function. Mimeo, University ofMichigan, 1951.Google ScholarGoogle Scholar
  11. 11.D. E. Critchlow. Metric Methods for Analyzing Partially Ranked Data, LNS 34, Springer-Verlag, 1985.Google ScholarGoogle Scholar
  12. 12.P. Diaconis. Group Representation in Probability and Statistics. IMS Lecture Series 11, IMS, 1988.Google ScholarGoogle Scholar
  13. 13.P. Diaconis and R. Graham. Spearman's footrule as a measure of disarray. J. of the Royal Statistical Society, Series B, 39(2):262-268, 1977.Google ScholarGoogle ScholarCross RefCross Ref
  14. 14.G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151-174, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  15. 15.R. Fagin. Combining Fuzzy information from multiple systems. JCSS, 58(1):83-99, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.J. Kleinberg. Authoritative sources in a hyperlinked environment. J. of the ACM, 46(5):604-632, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.J. I. Marden. Analyzing and Modeling Rank Data. Monographs on Statistics and Applied Probability, No 64, Chapman & Hall, 1995.Google ScholarGoogle Scholar
  18. 18.Media Metrix search engine ratings. www.searchenginewatch.com/reports/mediametrix.htmlGoogle ScholarGoogle Scholar
  19. 19.D. G. Saari. The mathematics of voting: Democratic symmetry. Economist, pp. 83, March 4, 2000.Google ScholarGoogle Scholar
  20. 20.G. Salton. Automatic Text Processing|the Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.J. H. Smith. Aggregation of Preferences with Variable Electorate. SIAM J. on Applied Math., 41:1027-1041, 1973.Google ScholarGoogle Scholar
  22. 22.M. Truchon. An extension of the Condorcet criterion and Kemeny orders. cahier 98-15 du Centre deRecherche en Economie et Finance Appliquees, 1998.Google ScholarGoogle Scholar
  23. 23.H. P. Young. An axiomatization of Borda's rule. J. Economic Theory, 9:43-52, 1974.Google ScholarGoogle ScholarCross RefCross Ref
  24. 24.H. P. Young. Condorcet's theory of Voting. Amer. Political Sci. Review, 82:1231-1244, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  25. 25.H. P. Young and A. Levenglick. A consistent extension of Condorcet's election principle. SIAM J. on Applied Math., 35(2):285-300, 1978.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Rank aggregation methods for the Web

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              WWW '01: Proceedings of the 10th international conference on World Wide Web
              May 2001
              770 pages
              ISBN:1581133480
              DOI:10.1145/371920

              Copyright © 2001 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 April 2001

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate1,899of8,196submissions,23%

              Upcoming Conference

              WWW '24
              The ACM Web Conference 2024
              May 13 - 17, 2024
              Singapore , Singapore

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader