• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Learning to Order Things (1998)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [dnkweb.denken.or.jp]
  • [www.cs.cmu.edu]
  • [www.research.att.com]
  • [www.research.att.com]
  • [www-connex.lip6.fr]
  • [www-poleia.lip6.fr]
  • [www-poleia.lip6.fr]
  • [www-connex.lip6.fr]
  • [people.csail.mit.edu]
  • [www.csail.mit.edu]
  • [people.csail.mit.edu]
  • [www.ai.mit.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by William W. Cohen , Robert E. Schapire , Yoram Singer
Venue:Journal of Artificial Intelligence Research
Citations:265 - 9 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Cohen98learningto,
    author = {William W. Cohen and Robert E. Schapire and Yoram Singer},
    title = {Learning to Order Things},
    journal = {Journal of Artificial Intelligence Research},
    year = {1998},
    volume = {10},
    pages = {243--270}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of preference judgments, i.e., statements to the effect that one instance should be ranked ahead of another. We outline a two-stage approach in which one first learns by conventional means a preference function, of the form PREF(u; v), which indicates whether it is advisable to rank u before v. New instances are then ordered so as to maximize agreements with the learned preference function. We show that the problem of finding the ordering that agrees best with a preference function is NP-complete, even under very restrictive assumptions. Nevertheless, we describe a simple greedy algorithm that is guaranteed to find a good approximation. We then discuss an on-line learning algorithm, based on the "Hedge" algorithm, for finding a good linear combination of ranking "experts." We use the ordering algorith...

Citations

2699 MJ: Introduction to Modern Information Retrieval - Salton, McGill - 1986
1714 Schapire R: A decision-theoretic generalization of online learning and an application to boosting - Freund - 1997
605 Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm - Littlestone - 1988
556 The weighted majority algorithm - Littlestone, Warmuth - 1994
500 Approximation Algorithms for NP--hard Problems - Hochbaum - 1997
383 An efficient boosting algorithm for combining preferences - Freund, Iyer, et al. - 1998
378 Y.: Fab: content-based, collaborative recommendation - Balabanovic, Shoham - 1997
253 Utility Theory for Decision Making - Fishburn - 1969
174 Theory of Committees and Elections - Black - 1958
130 Automatic combination of multiple ranked retrieval systems - Bartell, Cottrell, et al. - 1994
120 Decision Theory: An Introduction to the Mathematics of Rationality. Ellis Horwood - FRENCH - 1988
108 Computers and Intractability: A guide to the theory of NP-Completeness - Gary, Johnson - 1979
98 The Collection Fusion Problem - Voorhees, Gupta, et al. - 1994
98 Voting schemes for which it can be difficult to tell who won the election - Bartholdi, Tovey, et al. - 1989
86 Divide-andconquer approximation algorithms via spreading metrics - Even, Naor, et al.
76 Approximating minimum feedback sets and multi-cuts in directed graphs - Even, Naor, et al. - 1995
70 Expected Search Length: A Single Measure of Retrieval Effectiveness based on the Weak Ordering - Cooper - 1968
63 A machine learning architecture for optimizing web search engines - Boyan, Freitag, et al. - 1996
62 Packing Directed Circuits Fractionally - Seymour - 1993
62 Cut problems and their application to divide-and-conquer - Shmoys - 1997
55 Dynamic reference sifting: A case study in the homepage domain - Shakes, Langheinrich, et al. - 1997
52 Mathematics without numbers - Kemeny - 1959
51 Two kinds of training information for evaluation function learning - Utgoff, Clouse - 1991
47 The theory of social choice - Fishburn - 1973
41 Using the future to “sort out” the present: Rankprop and multitask learning for medical risk evaluation - Caruana, Baluja, et al. - 1996
38 Measuring Retrieval Effectiveness Based on User Preference of Documents - Yao - 1995
31 Measurement theory with applications to decision making, utility and the social sciences - Roberts - 1979
27 Efficient information gathering on the Internet - ETZIONI, HANKS, et al. - 1996
25 Learning collection fusion strategies for information retrieval - Towell, Voorhees, et al. - 1995
18 Learning a preference predicate - Utgoff, Saxena - 1987
15 Comparing and combining the effectiveness of latent semantic indexing and the ordinary vector space model for information retrieval - Lochbaum - 1989
14 Introduction (to the special section on recommender systems - Varian - 1997
13 Decision level data fusion for routing of documents in the TREC3 context: A best case analysis of worst case results - Kantor - 1995
10 Cyclic ordering is NP-complete - Galil, Megiddo - 1977
9 A Method for Taking Votes on More than Two Issues - Dodgson
9 Two kinds of training information for evaluation function learning - Utgo, Clouse - 1991
6 Voting schemes for which it can be di cult to tell who won the election - Bartholdi, Tovey, et al. - 1989
5 Learning a preference predicate - Utgo - 1987
2 Comparing and combining the eectiveness of latent semantic indexing and the ordinary vector space model for information retrieval. Information processing and management - Lochbaum - 1989
1 FAB: Content-based, collaborative recommendation - Balabanovc - 1997
1 Tight bounds for the acyclic subgraph problem - Berger, Shor - 1997
1 Learning to Order Things - Caruana, Baluja - 1996
1 Comparing and combiningthe effectiveness of latent semantic indexing and the ordinary vector space model for information retrieval. Information processing and management - Streeter - 1989
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University