{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:44:49Z","timestamp":1725529489431},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540879862"},{"type":"electronic","value":"9783540879879"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87987-9_21","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:20:06Z","timestamp":1237288806000},"page":"227-239","source":"Crossref","is-referenced-by-count":2,"title":["Smooth Boosting for Margin-Based Ranking"],"prefix":"10.1007","author":[{"given":"Jun-ichi","family":"Moribe","sequence":"first","affiliation":[]},{"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Balcan, N., Bansal, N., Beygelzimer, A., Coppersmith, D., Langford, J., Sorkin, G.B.: Robust reductions from ranking to classification. In: Proceedings of the 20th Annual Conference on Learning Theory, pp. 604\u2013619 (2007)","DOI":"10.1007\/978-3-540-72927-3_43"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0031-3203(96)00142-2","volume":"30","author":"A.P. Bradley","year":"1997","unstructured":"Bradley, A.P.: The use of the area under the roc curve in the evaluation of machine learning algorithms. Pattern Recognition\u00a030, 1145\u20131159 (1997)","journal-title":"Pattern Recognition"},{"key":"21_CR3","unstructured":"Bradley, J.K., Shapire, R.: Filterboost: Regression and classification on large datasets. In: Advances in Neural Information Processing Systems 20, pp. 185\u2013192 (2008)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Brefeld, U., Scheffer, T.: Auc maximizing support vector learning. In: Proceedings of the ICML Workshop on ROC Analysis in Machine Learning (2005)","DOI":"10.1145\/1015330.1015350"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1613\/jair.587","volume":"10","author":"W.W. Cohen","year":"1999","unstructured":"Cohen, W.W., Schapire, R.E., Singer, Y.: Learning to order things. Journal of Artificial Intelliegence Research\u00a010, 243\u2013279 (1999)","journal-title":"Journal of Artificial Intelliegence Research"},{"key":"21_CR6","unstructured":"Cortes, C., Mohri, M.: Auc optimization vs. error rate minimization. In: Advances in Neural Information Processing Systems 16 (2004)"},{"key":"21_CR7","unstructured":"Domingo, C., Watanabe, O.: MadaBoost: A modification of AdaBoost. In: Proceedings of 13th Annual Conference on Computational Learning Theory, pp. 180\u2013189 (2000)"},{"key":"21_CR8","unstructured":"Fawcett, T.: Roc graphs: Notes and practical considerations for researchers. Technical report, HPL-2003-4, HP (2003)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1162\/jmlr.2003.4.6.933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Shapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research\u00a04, 933\u2013969 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Gavinsky, D.: Optimally-smooth adaptive boosting and application to agnostic learning. Journal of Machine Learning Research (2003)","DOI":"10.1007\/3-540-36169-3_10"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Hatano, K.: Smooth boosting using an information-based criterion. In: Proceedings of the 17 th International Conference on Algorithmic Learning Theory, pp. 304\u2013319 (2006)","DOI":"10.1007\/11894841_25"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (2002)","DOI":"10.1145\/775047.775067"},{"key":"21_CR13","unstructured":"Long, P.M., Servedio, R.A.: Boosting the area under the roc curve. In: Advances in Neural Information Processing Systems 20 (2008)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Rudin, C.: Ranking with a p-norm push. In: Proceedings of 19th Annual Conference on Learning Theory, pp. 589\u2013604 (2006)","DOI":"10.1007\/11776420_43"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Rudin, C., Cortes, C., Mohri, M., Shapire, R.E.: Margin-based ranking meets boosting in the middle. In: Proceedings of the 18th Annual Conference on Learning Theory, pp. 63\u201378 (2005)","DOI":"10.1007\/11503415_5"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R.E. Schapire","year":"1999","unstructured":"Schapire, R.E., Singer, Y.: Improved boosting algorithms using confidence-rated predictions. Machine Learning\u00a037(3), 297\u2013336 (1999)","journal-title":"Machine Learning"},{"issue":"5","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1162\/089976600300015565","volume":"12","author":"B. Sch\u00f6lkopf","year":"2000","unstructured":"Sch\u00f6lkopf, B., Smola, A.J., Williamson, R.C., Bartlett, P.L.: New support vector algorithms. Neural Computation\u00a012(5), 1207\u20131245 (2000)","journal-title":"Neural Computation"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1162\/153244304773936072","volume":"4","author":"R.A. Servedio","year":"2003","unstructured":"Servedio, R.A.: Smooth boosting and learning with malicious noise. Journal of Machine Learning Research\u00a04, 633\u2013648 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"21_CR19","unstructured":"Warmuth, M., Glocer, K., R\u00e4tsch, G.: Boosting algorithms for maximizing the soft margin. In: Advances in Neural Information Processing Systems 20, pp. 1585\u20131592 (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87987-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:53:29Z","timestamp":1619524409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87987-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540879862","9783540879879"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87987-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}