Learning to order things

Journal of Artificial Intelligence Research

Volumn 10, Issue , 1999, Pages 243-270

  Cohen, William W ^a   Schapire, Robert E ^a   Singer, Yoram ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; GRAPH THEORY; LEARNING SYSTEMS; OPTIMIZATION; SEARCH ENGINES; THEOREM PROVING; WORLD WIDE WEB;

HEDGE ALGORITHM; ONLINE ALGORITHM; PREFERENCE FUNCTION;

COMPUTATIONAL COMPLEXITY;

EID: 0033314011     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.587     Document Type: Article

References (35)

1. Balabanovíc, M., & Shoham, Y. (1997). FAB: Content-based, collaborative recommendation. Communications of the ACM, 40(3), 66-72.
2. Bartell, B., Cottrell, G., & Belew, R. (1994). Automatic combination of multiple ranked retrieval systems. In Seventeenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.
3. Bartholdi, J., Tovey, C., & Trick, M. (1989). Voting schemes for which it can be difficult to tell who won the elections. Social Choice and Welfare, 6, 157-165.
4. Berger, B., & Shor, P. (1997). Tight bounds for the acyclic subgraph problem. Journal of Algorithms, 25, 1-18.
5. Black, D. (1958). Theory of Committees and Elections. Cambridge University Press.
6. Boyan, J., Freitag, D., & Joachims, T. (1994). A machine learning architecture for optimizing web search engines. Tech. rep. WS-96-05, American Association of Artificial Intelligence.
7. Caruana, R., Baluja, S., & Mitchell, T. (1996). Using the future to 'Sort Out' the present: Rankprop and multitask learning for medical risk evaluation. In Advances in Neural Information Processing Systems (NIPS) 8.
8. Cooper, W. (1968). Expected search length: A single measure of retrieval effectiveness based on the weak ordering action of retrieval systems. American Documentation, 19, 30-41.
9. Dodgson, C. (1876). A method for taking votes on more than two issues. Clarendon Press, Oxford. Reprinted with discussion in (Black, 1958).
10. Etzioni, O., Hanks, S., Jiang, T., Karp, R. M., Madani, O., & Waarts, O. (1996). Efficient information gathering on the internet. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS-96) Burlington, Vermont. IEEE Computer Society Press.
11. Even, G., Naor, J., Rao, S., & Schieber, B. (1996). Divide-and-conquer approximation algorithms via spreading metrics. In 36th Annual Symposium on Foundations of Computer Science (FOCS-96), pp. 62-71 Burlington, Vermont. IEEE Computer Society Press.
12. Even, G., Naor, J., Schieber, B., & Sudan, M. (1998). Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(1), 151-174.
13. Fishburn, F. (1970). Utility Theory for Decision Making. Wiley, New York.
14. French, S. (1989). Decision Theory: An Introduction to the Mathematics of Rationality. Ellis Horwood Series in Mathematics and Its Applications.
15. Freund, Y., Iyer, R., Schapire, R., & Singer, Y. (1998). An efficient boosting algorithm for combining preferences. In Machine Learning: Proceedings of the Fifteenth International Conference.
16. Freund, Y., & Schapire, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119-139.
17. Galil, Z., & Megido, N. (1977). Cyclic ordering is NP-complete. Theoretical Computer Science, 5, 179-182.
18. Gary, M., & Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York.
19. Kantor, P. (1994). Decision level data fusion for routing of documents in the TREC3 context: a best case analysis of worst case results. In Proceedings of the third text retrieval conference (TREC-3).
20. Kemeny, J. (1959). Mathematics without numbers. Daedalus, 88, 571-591.
21. Kemeny, J., & Snell, J. (1962). Mathematical Models in the Social Sciences. Blaisdell, New York.
22. Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4).
23. Littlestone, N., & Warmuth, M. (1994). The weighted majority algorithm. Information and Computation, 108(2), 212-261.
24. Lochbaum, K., & Streeter, L. (1989). Comparing and combining the effectiveness of latent semantic indexing and the ordinary vector space model for information retrieval. Information processing and management, 25(6), 665-676.
25. Resnick, P., & Varian, H. (1997). Introduction to special section on Recommender Systems. Communication of the ACM, 40(3).
26. Roberts, F. (1979). Measurement theory with applications to decision making, utility, and social sciences. Addison Wesley, Reading, MA.
27. Salton, G., & McGill, M. (1983). Introduction to Modern Information Retrieval. McGraw-Hill.
28. Seymour, P. (1995). Packing directed circuits fractionally. Combinatorica, 15, 281-288.
29. Shakes, J., Langheinrich, M., & Etzioni, O. (1997). Dynamic reference sifting: a case study in the homepage domain. In Proceedings of WWW6.
30. Shmoys, D. (1997). Cut problems and their application to divide-and-conquer. In Hochbaum, D. (Ed.), Approximation algorithms for NP-Hard Problems. PWS Publishing Company, New York.
31. Towell, G., Voorhees, E., Gupta, N., & Johnson-Laird, B. (1995). Learning collection fusion strategies for information retrieval. In Machine Learning: Proceedings of the Twelfth International Conference Lake Taho, California. Morgan Kaufmann.
32. Utgoff, P., & Clouse, J. (1991). Two kinds of training information for evaluation function learning. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), pp. 596-600 Cambridge, MA. AAAI Press/MIT PRess.
33. Utgoff, P., & Saxena, S. (1987). Learning a preference predicate. In Proceedings of the Fourth International Workshop on Machine Learning, pp. 115-121 San Francisco, CA. Morgan Kaufmann.
34. Voorhees, E., Gupta, N., & Johnson-Laird, B. (1994). The collection fusion problem. In Seventeenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.
35. Yao, Y. (1995). Measuring retrieval effectiveness based on user preference of documents. Journal of the American Society for Information Science, 46(2), 133-145.