How to reverse-engineer quality rankings

Machine Learning

Volumn 88, Issue 3, 2012, Pages 369-398

  Chang, Allison ^a   Rudin, Cynthia ^b   Cavaretta, Michael ^c   Robert Thomas, ^c   Gloria Chou, ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c FORD MOTOR COMPANY   (United States)

Author keywords

Applications of machine learning; Discrete optimization; Quality ratings; Reverse engineering; Supervised ranking

Indexed keywords

CRITICAL STEPS; DISCRETE OPTIMIZATION; LEARNING APPROACH; PREFERENCE INFORMATION; PRODUCT QUALITY; QUALITY RANKING; QUALITY RATINGS; RANK STATISTICS; SUPERVISED RANKING;

ENGINEERS; INDUSTRY; LEARNING SYSTEMS; PRODUCT DEVELOPMENT;

RATING;

EID: 84865269307     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-012-5295-6     Document Type: Article

References (24)

1. Ataman, K., Street, W. N., & Zhang, Y. (2006). Learning to rank by maximizing AUC with linear programming. In International joint conference on neural networks.
2. Bajek, E. (2008). (Almost) How the Elias Sports Bureau rankings work. Unpublished blog entry at http:// tigers-thoughts.blogspot.com/2008/07/almost- how-elias-sports-bureau-rankings.html.
3. Bertsimas, D., & Weismantel, R. (2005). Optimization over integers. Charlestown: Dynamic Ideas.
4. Bertsimas, D., Chang, A., & Rudin, C. (2010). A discrete optimization approach to supervised ranking. In Proceedings of the 5th INFORMS workshop on data mining and health informatics (DM-HI 2010).
5. Bertsimas, D., Chang, A., & Rudin, C. (2011). Integer optimization methods for supervised ranking. MIT DSpace, Operations Research Center. Working paper available at http://dspace.mit.edu/ handle/1721.1/67362.
6. Burges, C. J., Ragno, R., & Le, Q. (2006). Learning to rank with nonsmooth cost functions. In Proceedings of neural information processing systems (NIPS) (pp. 395-402).
7. Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007). Learning to rank: From pairwise approach to listwise approach. In Proceedings of the 24th international conference on machine learning (ICML) (pp. 129-136).
8. Chandler, S. J. (2006). Analyzing US News and World Report rankings using symbolic regression. Unpublished blog entry at http://taxprof.typepad.com/ taxprof-blog/files/analyzing-u.S.News& WorldReportRankingsUsingSymbolicRegression.pdf.
9. Cossock, D., & Zhang, T. (2006). Subset ranking using regression. In Proceedings of the 19th conference on learning theory (COLT) (pp. 605-619). (Pubitemid 44072222)
10. Ferri, C., Flach, P., & Hernández-Orallo, J. (2002). Learning decision trees using the area under the ROC curve. In Proceedings of the 19th international conference on machine learning (ICML) (pp. 139-146).
11. Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933-969.
12. Green, P. E., Krieger, A. M., & Wind, Y. (J.) (2001). Thirty years of conjoint analysis: Reflections and prospects. Interfaces, 31(3), S56-S73. (Pubitemid 33317336)
13. Hammer, P. L., Kogan, A., & Lejeune, M. A. (2007). Reverse-engineering banks' financial strength ratings using logical analysis of data. Working paper available at http://www.optimization-online.org/DB-FILE/ 2007/02/1581.pdf.
14. Joachims, T. (2002). Optimizing search engines using clickthrough data. In Proceedings of the ACM conference on knowledge discovery and data mining (KDD). New York: ACM Press.
15. Kendall, M. G. (1938). A new measure of rank correlation. Biometrika, 30(1/2), 81-93.
16. Lafferty, J., & Zhai, C. (2001). Document language models, query models, and risk minimization for information retrieval. In Proceedings of the 24th annual international ACM SIGIR conference on research and development in information retrieval (pp. 111-119). New York: ACM Press. (Pubitemid 32951063)
17. Le, Q., & Smola, A. (2007). Direct optimization of ranking measures. arXiv:0704.3359v1 [cs.IR].
18. Li, P., Burges, C. J., & Wu, Q. (2007). McRank: Learning to rank using multiple classification and gradient boosting. In Proceedings of neural information processing systems (NIPS).
19. Matveeva, I., Laucius, A., Burges, C., Wong, L., & Burkard, T. (2006). High accuracy retrieval with multiple nested ranker. In Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval (pp. 437-444). New York: ACM Press.
20. Morgenson, G., & Story, L. (2010). Rating agency data aided wall street in deals. New York Times, Business section, April 24, 2010. Article at http://www.nytimes.com/2010/04/24/business/24rating.html.
21. Rudin, C. (2009). The P-Norm Push: A simple convex ranking algorithm that concentrates at the top of the list. Journal of Machine Learning Research, 10, 2233-2271.
22. Su, A.-J., Hu, Y. C., Kuzmanovic, A., & Koh, C.-K. (2010). How to improve your Google ranking: Myths and reality. In IEEE/WIC/ACMinternational conference on web intelligence and intelligent agent technology (WI-IAT) (Vol. 1, pp. 50-57).
23. Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y., & Singer, Y. (2005). Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6, 1453-1484.
24. Xu, J., Liu, T. Y., Lu, M., Li, H., & Ma, W. Y. (2008). Directly optimizing evaluation measures in learning to rank. In Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval. New York: ACM Press.