{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:21:43Z","timestamp":1761805303095},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,8]],"date-time":"2013-02-08T00:00:00Z","timestamp":1360281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,2,8]],"date-time":"2013-02-08T00:00:00Z","timestamp":1360281600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10791-013-9219-2","type":"journal-article","created":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T03:49:10Z","timestamp":1360208950000},"page":"1-20","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/http\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Improving ranking performance with cost-sensitive ordinal classification via regression"],"prefix":"10.1007","volume":"17","author":[{"given":"Yu-Xun","family":"Ruan","sequence":"first","affiliation":[]},{"given":"Hsuan-Tien","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Ming-Feng","family":"Tsai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,8]]},"reference":[{"issue":"2","key":"9219_CR1","first-page":"123","volume":"24","author":"L. Breiman","year":"1996","unstructured":"Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123\u2013140.","journal-title":"Machine Learning"},{"key":"9219_CR2","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005). Learning to rank using gradient descent. In Proceedings of ICML \u201905, ACM, pp. 89\u201396.","DOI":"10.1145\/1102351.1102363"},{"key":"9219_CR3","first-page":"193","volume-title":"Advances in neural information processing systems (NIPS)","author":"C Burges","year":"2006","unstructured":"Burges, C., Ragno, R., & Le, Q. V. (2006). Learning to rank with nonsmooth cost functions. In Y. Weiss, B. Sch\u00f6lkopf & J.  Platt (Eds.), Advances in neural information processing systems (NIPS) (Vol. 18, pp. 193\u2013200).      Massachusetts, USA:  MIT Press."},{"key":"9219_CR4","doi-asserted-by":"crossref","unstructured":"Chapelle, O., Metlzer, D., Zhang, Y., & Grinspan, P. (2009). Expected reciprocal rank for graded relevance. In Proceedings of CIKM \u201909, ACM, pp. 621\u2013630.","DOI":"10.1145\/1645953.1646033"},{"key":"9219_CR5","doi-asserted-by":"crossref","unstructured":"Cossock, D., & Zhang, T. (2006). Subset ranking using regression. In Proceedings of COLT \u201906, Springer, pp. 605\u2013619.","DOI":"10.1007\/11776420_44"},{"key":"9219_CR6","first-page":"641","volume-title":"Advances in neural information processing systems (NIPS)","author":"K Crammer","year":"2002","unstructured":"Crammer, K., & Singer, Y. (2002). Pranking with ranking. In T. G. Dietterich, S. Becker & Z. Ghahramani (Eds.),    Advances in neural information processing systems (NIPS) (Vol. 14, pp. 641\u2013647). Massachusetts, USA: MIT Press."},{"key":"9219_CR7","doi-asserted-by":"crossref","unstructured":"Frank, E., & Hall, M. (2001). A simple approach to ordinal classification. In Machine learning: Proceedings of the 12th European conference on machine learning, Springer, pp. 145\u2013156.","DOI":"10.1007\/3-540-44795-4_13"},{"key":"9219_CR8","first-page":"933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"key":"9219_CR9","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"J. H. Friedman","year":"2001","unstructured":"Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29, 1189\u20131232.","journal-title":"Annals of Statistics"},{"key":"9219_CR10","doi-asserted-by":"crossref","unstructured":"F\u00fcrnkranz, J., H\u00fcllermeier, E., & Vanderlooy, S. (2009). Binary decomposition methods for multipartite ranking. In ECML\/PKDD (1). Springer, Vol. 5781.","DOI":"10.1007\/978-3-642-04180-8_41"},{"issue":"1","key":"9219_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M. Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009). The weka data mining software: an update. SIGKDD Explorations Newsletter, 11(1), 10\u201318.","journal-title":"SIGKDD Explorations Newsletter"},{"key":"9219_CR12","volume-title":"The elements of statistical learning: Data mining, inference, and prediction","author":"T. Hastie","year":"2003","unstructured":"Hastie, T., Tibshirani, R., & Friedman, J. (2003). The elements of statistical learning: Data mining, inference, and prediction. New York: Springer."},{"issue":"4","key":"9219_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., & Kek\u00e4l\u00e4inen, J. (2002). Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 20(4), 422\u2013446.","journal-title":"ACM Transactions on Information Systems"},{"key":"9219_CR14","doi-asserted-by":"crossref","unstructured":"Joachims, T. (2002). Optimizing search engines using clickthrough data. In Proceedings of KDD \u201902, ACM, pp. 133\u2013142.","DOI":"10.1145\/775047.775067"},{"key":"9219_CR15","volume-title":"Advances in neural information processing systems (NIPS)","author":"P Li","year":"2007","unstructured":"Li, P., Burges, C., Wu, Q., Platt, J. C., Koller, D., Singer, Y., & Roweis, S. (2007). Mcrank: Learning to rank using multiple classification and gradient boosting. In B. Sch\u00f6lkopf, J. Platt & T. Hofmann (Eds.),  Advances in neural information processing systems (NIPS) (Vol. 19). Massachusetts, USA: MIT Press."},{"issue":"5","key":"9219_CR16","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1162\/NECO_a_00265","volume":"24","author":"H. T. Lin","year":"2012","unstructured":"Lin, H. T., & Li, L. (2012). Reduction from cost-sensitive ordinal ranking to weighted binary classification. Neural Computation, 24(5), 1329\u20131367.","journal-title":"Neural Computation"},{"key":"9219_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"T. Y. Liu","year":"2009","unstructured":"Liu, T. Y. (2009). Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3, 225\u2013331.","journal-title":"Foundations and Trends in Information Retrieval"},{"key":"9219_CR18","doi-asserted-by":"crossref","unstructured":"Lv, Y., Moon, T., Kolari, P., Zheng, Z., Wang, X., & Chang, Y. (2011). Learning to model relatedness for news recommendation. In Proceedings of WWW \u201911, ACM, pp. 57\u201366","DOI":"10.1145\/1963405.1963417"},{"key":"9219_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1416950.1416952","volume":"27","author":"A. Moffat","year":"2008","unstructured":"Moffat, A., & Zobel, J. (2008). Rank-biased precision for measurement of retrieval effectiveness. ACM Transactions on Information Systems, 27, 2:1\u20132:27.","journal-title":"ACM Transactions on Information Systems"},{"key":"9219_CR20","first-page":"77","volume":"14","author":"A. Mohan","year":"2011","unstructured":"Mohan, A., Chen, Z., & Weinberger, K. Q. (2011). Web-search ranking with initialized gradient boosted regression trees. Journal of Machine Learning Research Workshop and Conference Proceedings, 14, 77\u201389.","journal-title":"Journal of Machine Learning Research Workshop and Conference Proceedings"},{"key":"9219_CR21","unstructured":"Quinlan, R. J. (1992). Learning with continuous classes. In Proceedings of IJCAI \u201992, World Scientific, pp. 343\u2013348."},{"key":"9219_CR22","doi-asserted-by":"crossref","unstructured":"Richardson, M., Prakash, A., & Brill, E. (2006). Beyond PageRank: machine learning for static ranking. In Proceedings of WWW \u201906, ACM, pp. 707\u2013715.","DOI":"10.1145\/1135777.1135881"},{"key":"9219_CR23","unstructured":"Shivaswamy, P., & Joachims, T. (2002). Online structured prediction via coactive learning. In Proceedings of ICML \u201912, ACM, pp. 1431\u20131438."},{"issue":"9","key":"9219_CR24","first-page":"1453","volume":"6","author":"I. Tsochantaridis","year":"2005","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., & Altun, Y. (2005). Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6(9), 1453\u20131484.","journal-title":"Journal of Machine Learning Research"},{"key":"9219_CR25","unstructured":"Valizadegan, H., Jin, R., Zhang, R., & Mao, J. (1999). Learning to rank by optimizing ndcg measure. In Advances in neural information processing systems (NIPS) (pp. 1883\u20131891). MIT Press."},{"key":"9219_CR26","doi-asserted-by":"crossref","unstructured":"Volkovs, M. N., & Zemel, R. S. (2009). Boltzrank: Learning to maximize expected ranking gain. In Proceedings of ICML \u201909, ACM, pp. 1089\u20131096.","DOI":"10.1145\/1553374.1553513"},{"key":"9219_CR27","unstructured":"Wang, Y., & Witten, I. H. (1997). Induction of model trees for predicting continuous classes. In Proceedings of ECML \u201997, Springer, pp. 128\u2013137."},{"key":"9219_CR28","doi-asserted-by":"crossref","unstructured":"Yue, Y., & Finley, T. (2007). A support vector method for optimizing average precision. In Proceedings of SIGIR \u201907, ACM, pp. 271\u2013278.","DOI":"10.1145\/1277741.1277790"},{"key":"9219_CR29","doi-asserted-by":"crossref","unstructured":"Zadrozny, B., Langford, J., & Abe, N. (2003). Cost sensitive learning by cost-proportionate example weighting. In Proceedings of the 3rd IEEE International conference on data mining, IEEE Computer Society (pp. 435\u2013442).","DOI":"10.1109\/ICDM.2003.1250950"}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s10791-013-9219-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10791-013-9219-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10791-013-9219-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s10791-013-9219-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:07:37Z","timestamp":1704204457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/10.1007\/s10791-013-9219-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,8]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9219"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s10791-013-9219-2","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,8]]},"assertion":[{"value":"21 October 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2013","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}