{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:46:25Z","timestamp":1765039585085,"version":"3.37.3"},"reference-count":23,"publisher":"Informa UK Limited","issue":"5","license":[{"start":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T00:00:00Z","timestamp":1638748800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grant Agency of the Czech Republic","doi-asserted-by":"publisher","award":["18-21409S"],"award-info":[{"award-number":["18-21409S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018240","name":"Research Center for Informatics","doi-asserted-by":"crossref","award":["CZ02.1.01\/0.0.\/0.0.\/16_019\/0000765"],"award-info":[{"award-number":["CZ02.1.01\/0.0.\/0.0.\/16_019\/0000765"]}],"id":[{"id":"10.13039\/100018240","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2022,9,3]]},"DOI":"10.1080\/10556788.2021.1965601","type":"journal-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T05:11:45Z","timestamp":1638853905000},"page":"1636-1667","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["General framework for binary classification on top samples"],"prefix":"10.1080","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8748-4308","authenticated-orcid":false,"given":"L.","family":"Adam","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"}]},{"given":"V.","family":"M\u00e1cha","sequence":"additional","affiliation":[{"name":"Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague, Prague, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3027-6174","authenticated-orcid":false,"given":"V.","family":"\u0160m\u00eddl","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"},{"name":"The Czech Academy of Sciences, Institute of Information Theory and Automation, Prague, Czech Republic"}]},{"given":"T.","family":"Pevn\u00fd","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"}]}],"member":"301","published-online":{"date-parts":[[2021,12,6]]},"reference":[{"key":"CIT0001","unstructured":"L. Adam and M. Branda, Machine learning approach to chance-constrained problems: An algorithm based on the stochastic gradient descent, preprint (2019). Available at arXiv:1905.10986."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.72"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1140\/epjc\/s10052-016-4099-4"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"CIT0005","unstructured":"S. Boyd, C. Cortes, M. Mohri, and A. Radovanovic, Accuracy at the top, In Advances in Neural Information Processing Systems, Lake Tahoe, NV, 2012, pp. 953\u2013961."},{"key":"CIT0006","first-page":"1","volume":"7","author":"Dem\u0161ar J.","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0007","unstructured":"E. Eban, M. Schain, A. Mackey, A. Gordon, R. Rifkin, and G. Elidan, Scalable learning of non-decomposable objectives, In Artificial Intelligence and Statistics, Fort Lauderdale, FL, 2017, pp. 832\u2013840."},{"key":"CIT0008","first-page":"933","volume":"4","author":"Freund Y.","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.05.021"},{"key":"CIT0010","unstructured":"I. Guyon, S. Gunn, A. Ben-Hur, and G. Dror, Result analysis of the NIPS 2003 feature selection challenge, In Advances in Neural Information Processing Systems, Cambridge, MA, 2005, pp. 545\u2013555."},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"CIT0012","unstructured":"P. Kar, H. Narasimhan, and P. Jain, Surrogate functions for maximizing precision at the top, In International Conference on Machine Learning, Lille, France, 2015, pp. 189\u2013198."},{"key":"CIT0013","unstructured":"D. Kingma and J. Ba, Adam: A method for stochastic optimization, preprint (2014). Available at arXiv:1412.6980."},{"key":"CIT0014","unstructured":"M. Lapin, M. Hein, and B. Schiele, Top-k multiclass SVM, In Advances in Neural Information Processing Systems, Montreal, Canada, 2015, pp. 325\u2013333."},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2751607"},{"key":"CIT0016","unstructured":"N. Li, R. Jin, and Z.H. Zhou, Top rank optimization in linear time, In Proceedings of the 27th International Conference on Neural Information Processing Systems\u2014Volume 1, NIPS'14, MIT Press, Cambridge, MA, USA, 2014, pp. 1502\u20131510."},{"key":"CIT0017","unstructured":"V. M\u00e1cha, L. Adam, and V. \u0160m\u00eddl, Nonlinear classifiers for ranking problems based on kernelized SVM, preprint (2020). Available at arXiv:2002.11436."},{"key":"CIT0018","unstructured":"A. Mackey, X. Luo, and E. Eban, Constrained classification and ranking via quantiles, preprint (2018). Available at arXiv:1803.00067."},{"key":"CIT0019","first-page":"2233","volume":"10","author":"Rudin C.","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"issue":"3","key":"CIT0021","first-page":"262","volume":"10","author":"Sigillito V.G.","year":"1989","journal-title":"Johns Hopkins APL Tech. Dig."},{"key":"CIT0022","unstructured":"D. Tasche, A plug-in approach to maximising precision at the top and recall at the top, preprint (2018). Available at arXiv:1804.03077."},{"key":"CIT0023","doi-asserted-by":"crossref","unstructured":"A. Zhang, N. Li, J. Pu, J. Wang, J. Yan, and H. Zha, tau-FPL: Tolerance-constrained learning in linear time, preprint (2018). Available at arXiv:1801.04701.","DOI":"10.1609\/aaai.v32i1.11789"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2021.1965601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T14:55:36Z","timestamp":1671202536000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2021.1965601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,6]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9,3]]}},"alternative-id":["10.1080\/10556788.2021.1965601"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2021.1965601","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2021,12,6]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-10-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}