{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T21:20:48Z","timestamp":1768598448711,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540453758","type":"print"},{"value":"9783540460565","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11871842_86","type":"book-chapter","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T08:28:47Z","timestamp":1158568127000},"page":"833-840","source":"Crossref","is-referenced-by-count":19,"title":["Cost-Sensitive Learning of SVM for Ranking"],"prefix":"10.1007","author":[{"given":"Jun","family":"Xu","sequence":"first","affiliation":[]},{"given":"Yunbo","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Hang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yalou","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"86_CR1","doi-asserted-by":"crossref","unstructured":"Abe, N., Zadrozny, B., Langford, J.: An Iterative Method for Multi-class Cost-sensitive Learning. In: Proc. of 10th Inter. Conf. on KDD, Seattle, Washington, USA, pp. 3\u201311 (2004)","DOI":"10.1145\/1014052.1014056"},{"key":"86_CR2","volume-title":"Modern Information Retrieval","author":"R.A. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R.A., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc, Boston (1999)"},{"key":"86_CR3","doi-asserted-by":"crossref","unstructured":"Bradford, J., Kunz, C., Kohavi, R., Brunk, C., Brodley, C.: Pruning decision trees with misclassification costs. In: Proc. of ECML, Chemnitz, Germany, pp. 131\u2013136 (1998)","DOI":"10.1007\/BFb0026682"},{"key":"86_CR4","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to Rank using Gradient Descent. In: Proc. of 22nd ICML, Bonn, Germany (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"86_CR5","unstructured":"Cao, Y., Xu, J., Liu, T., Li, H., Huang, Y., Hon, H.W.: An Ordinal Regression Method for Document Retrieval. In: Proc. of 29th Inter. ACM SIGIR Conf. (to appear, 2006)"},{"key":"86_CR6","doi-asserted-by":"crossref","unstructured":"Chu, W., Keerthi, S.: New Approaches to Support Vector Ordinal Regression. In: Proc. of ICML, Bonn, Germany, pp. 145\u2013152 (2005)","DOI":"10.1145\/1102351.1102370"},{"key":"86_CR7","first-page":"641","volume-title":"Advances in NIPS 14","author":"K. Crammer","year":"2002","unstructured":"Crammer, K., Singer, Y.: PRanking with Ranking. In: Advances in NIPS 14, pp. 641\u2013647. MIT Press, Cambridge (2002)"},{"key":"86_CR8","doi-asserted-by":"crossref","unstructured":"Domingos, P.: MetaCost: A general method for making classifiers cost sensitive. In: Proc. of the 5th KDD, San Diego, CA, USA, pp. 155\u2013164 (1999)","DOI":"10.1145\/312129.312220"},{"key":"86_CR9","unstructured":"Elkan, C.: The Foundations of Cost-Sensitive Learning. In: Proc. of the 17th Inter. Joint Conf. on Artificial Intelligence, pp. 973\u2013978 (2001)"},{"key":"86_CR10","doi-asserted-by":"crossref","unstructured":"Frank, E., Hall, M.: A Simple Approach to Ordinal Classification. In: Proc. of ECML, Freiburg, Germany, pp. 145\u2013165 (2001)","DOI":"10.1007\/3-540-44795-4_13"},{"key":"86_CR11","unstructured":"Geibel, P., Wysotzki, F.: Perceptron based learning with example dependent and noisy costs. In: Proc. of 12th ICML, Washington, DC, USA (2003)"},{"key":"86_CR12","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Roth, D., Zimak, D.: Constraint classification: A new approach to multiclass classification and ranking. In: Advances in NIPS 15 (2002)","DOI":"10.1007\/3-540-36169-3_29"},{"key":"86_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning: data mining, inference and prediction","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: data mining, inference and prediction. Springer, Heidelberg (2001)"},{"key":"86_CR14","doi-asserted-by":"crossref","unstructured":"Herbrich, R., Graepel, T., Obermayer, K.: Large Margin Rank Boundaries for Ordinal Regression. In: Advances in Large Margin Classifiers, pp. 115\u2013132 (2000)","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"86_CR15","doi-asserted-by":"crossref","unstructured":"Hersh, W.R., Buckley, C., Leone, T.J., Hickam, D.H.: OHSUMED: An interactive retrieval evaluation and new large test collection for research. In: Proc. of the 17th Inter. ACM SIGIR Conf., pp. 192\u2013201 (1994)","DOI":"10.1007\/978-1-4471-2099-5_20"},{"key":"86_CR16","doi-asserted-by":"crossref","unstructured":"Jarvelin, K., Kekalainen, J.: IR evaluation methods for retrieving highly relevant documents. In: Proc. of the 23rd Inter. ACM SIGIR Conf., pp. 41\u201348 (2000)","DOI":"10.1145\/345508.345545"},{"key":"86_CR17","first-page":"1","volume":"47","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., Widmer, G., Pfahringer, B., Degroeve, M.: Prediction of ordinal classes using regression trees. Fundamenta Informaticae\u00a047, 1\u201313 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"86_CR18","unstructured":"Monard, M.C., Batista, G.E.A.P.A.: Learning with Skewed Class Distribution. Advances in Logic, Artificial Intelligence and Robotics, Sao Paulo, SP, 173\u2013180 (2002)"},{"key":"86_CR19","doi-asserted-by":"crossref","unstructured":"Nallapati, R.: Discriminative models for information retrieval. In: Proc. of the 27th Inter. ACM SIGIR Conf., Sheffield, United Kingdom, pp. 64\u201371 (2004)","DOI":"10.1145\/1008992.1009006"},{"key":"86_CR20","doi-asserted-by":"crossref","unstructured":"Ponte, J., Croft, W.B.: A language model approach to information retrieval. In: Proc. of the Inter. ACM SIGIR Conf., pp. 275\u2013281 (1998)","DOI":"10.1145\/290941.291008"},{"key":"86_CR21","doi-asserted-by":"crossref","unstructured":"Robertson, S., Hull, D.A.: The TREC-9 Filtering Track Final Report. In: Proc. of the 9th TREC, pp. 25\u201340 (2000)","DOI":"10.6028\/NIST.SP.500-249.filtering-overview"},{"issue":"3","key":"86_CR22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1109\/2.989940","volume":"35","author":"A. Spink","year":"2002","unstructured":"Spink, A., Jansen, B.J., Wolfram, D., Saracevic, T.: From e-sex to e-commerce: Web search changes. IEEE Computer\u00a035(3), 107\u2013109 (2002)","journal-title":"IEEE Computer"},{"key":"86_CR23","doi-asserted-by":"crossref","unstructured":"Xu, J., Cao, Y., Li, H., Zhao, M.: Ranking Definitions with Supervised Learning Methods. In: Proc. of the 14th Inter. Conf. on World Wide Web, pp. 811\u2013819 (2005)","DOI":"10.1145\/1062745.1062761"},{"key":"86_CR24","doi-asserted-by":"crossref","unstructured":"Zadrozny, B., Elkan, C.: Learning and making decisions when costs and probabilities are both unknown. In: Proc. of the 7th Inter. Conf. on KDD, pp. 204\u2013213 (2001)","DOI":"10.1145\/502512.502540"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11871842_86.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:51:09Z","timestamp":1736545869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11871842_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540453758","9783540460565"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11871842_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}