Toward optimal ordering of prediction tasks

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 2, Issue , 2009, Pages 879-888

  Lad, Abhimanyu ^a   Yang, Yiming ^a   Ghani, Rayid ^b   Kisiel, Bryan ^a  

^a Carnegie Mellon University   (United States)

^b ACCENTURE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ASSISTED; CONDITIONAL ENTROPY; DOCUMENT ANNOTATION; EXHAUSTIVE SEARCH; LINEAR ORDERINGS; OPTIMAL ORDERING; PREDICTION SYSTEMS; PREDICTION TASKS; PREDICTIVE PERFORMANCE; REPORT GENERATION; SIGNIFICANT IMPACTS; TASK DEPENDENCIES; USER INTERACTION;

CLASSIFIERS; COMPUTER APPLICATIONS; LEARNING SYSTEMS; OPTIMIZATION; SET THEORY;

INTELLIGENT AGENTS;

EID: 72749104430     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. A. Agresti. Categorical data analysis. Wiley New York, 1990.
2. R.K. Ando and T. Zhang. A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data. The Journal of Machine Learning Research, 6:1817-1853, 2005.
3. J.P. Barthélemy, B. Leclerc, and B. Monjardet. On the use of ordered sets in problems of comparison and consensus of classifications. Journal of Classification, 3(2): 187-224, 1986.
4. B. Berger and P.W. Shor. Approximation algorithms for the maximum acyclic subgraph problem. In Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pages 236-243. Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 1990.
5. C. Buckley and EM Voorhees. Retrieval system evaluation. TREC: Experiment and Evaluation in Information Retrieval, pages 53-75, 2005.
6. C.J.C. Burges, R. Ragno, and Q.V. Le. Learning to Rank with Nonsmooth Cost Functions. In Advances in Neural Information Processing Systems: Proceedings of the 2006 Conference. MIT Press, 2007.
7. R. Caruana and A. Niculescu-Mizil. An empirical comparison of supervised learning algorithms. In Proceedings of the 23rd international conference on Machine learning, pages 161-168. ACM New York, NY, USA, 2006.
8. I. Charon and O. Hudry. A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments. Discrete Applied Mathematics, 154(15):2097-2116, 2006.
9. I. Charon and O. Hudry. A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR: A Quarterly Journal of Operations Research, 5(1):5-60, 2007.
10. W.W. Cohen, R.E. Schapire, and Y. Singer. Learning to order things. In Proceedings of the 1997 conference on Advances in neural information processing systems 10 table of contents, pages 451-457. MIT Press Cambridge, MA, USA, 1998.
11. D. Cohn, L. Atlas, and R. Ladner. Improving generalization with active learning. Machine Learning, 15(2):201-221, 1994.
12. T. Cover and P. Hart. Nearest neighbor pattern classification. Information Theory, IEEE Transactions on, 13(1):21-27, 1967.
13. G. Forman. An extensive empirical study of feature selection metrics for text classification. The Journal of Machine Learning Research, 3:1289-1305, 2003.
14. M.R. Garey, D.S. Johnson, et al. Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman San Francisco, 1979.
15. L. Getoor, D. Koller, B. Taskar, and N. Friedman. Learning statistical models from relational data. In Proc AAAI, pages 580-587, 2000.
16. R. Greiner, A.J. Grove, and D. Roth. Learning cost-sensitive active classifiers. Artificial Intelligence, 139(2):137-174, 2002.
17. M. GrÖtschel, M. JÜnger, and G. Reinelt. A cutting plane algorithm for the linear ordering problem. Operations research, 32(6):1195-1220, 1984.
18. R. Hassin and S. Rubinstein. Approximations for the Maximum Acyclic Subgraph Problem. Information Processing Letters, 51(3):133-140, 1994.
19. T. Joachims. Text Categorization with Support Vector Machines: Learning with Many Relevant Features. Springer, 1997.
20. D.D. Lewis. Evaluating text categorization. In Proceedings of Speech and Natural Language Workshop, pages 312-318. Morgan Kaufmann, 1991.
21. P. Li, C. Burges, Q. Wu, JC Platt, D. Koller, Y. Singer, and S. Roweis. McRank: Learning to Rank Using Multiple Classification and Gradient Boosting. Advances in Neural Information Processing Systems, 2007.
22. J.E. Mitchell and B. Borchers. Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm. High Performance Optimization, pages 349-366, 2000.
23. G. Reinelt. The linear ordering problem: algorithms and applications, Research and Exposition in Mathematics 8. Berlin: Heldermann, 1985.
24. R. Rifkin and A. Klautau. In Defense of One-Vs-All Classification. The Journal of Machine Learning Research, 5:101-141, 2004.
25. B. Taskar, E. Segal, and D. Koller. Probabilistic Classification and Clustering in Relational Data. In International Joint Conference on Artificial Intelligence, volume 17, pages 870-878, 2001.
26. M. Taylor, J. Guiver, S. Robertson, and T. Minka. SoftRank: optimizing non-smooth rank metrics. In Proceedings of the international conference on Web search and web data mining, pages 77-86. ACM New York, NY, USA, 2008.
27. CJ Van Rijsbergen. Information Retrieval. Butterworth-Heinemann Newton, MA, USA, 1979.
28. V.N. Vapnik. Statistical learning theory. John Wiley & Sons, 1997.
29. Y. Yang. A study of thresholding strategies for text categorization. In Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, pages 137-145. ACM New York, NY, USA, 2001.
30. Y. Yang and J.O. Pedersen. A Comparative Study on Feature Selection in Text Categorization. In International Conference on Machine Learning, pages 412-420. Morgan Kauffman Publications, INC., 1997.
31. Y. Yue, T. Finley, F. Radlinski, and T. Joachims. A support vector method for optimizing average precision. In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 271-278. ACM Press New York, NY, USA, 2007.
32. J. Zhang, Z. Ghahramani, and Y. Yang. Learning Multiple Related Tasks using Latent Independent Component Analysis. Advances in Neural Information Processing Systems, 18:1585, 2006.
33. X. Zhu, J. Lafferty, and Z. Ghahramani. Combining active learning and semi-supervised learning using gaussian fields. ICML 2003 Workshop on the Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining, 2003.