{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:23:21Z","timestamp":1740165801571,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Federal Ministry of Education and Research BMBF through the Berlin Big Data Center Project","award":["FKZ 01IS18025A"],"award-info":[{"award-number":["FKZ 01IS18025A"]}]},{"name":"German Research Foundation DFG through Grant Math EXC 2046 1","award":["390685689"],"award-info":[{"award-number":["390685689"]}]},{"name":"Institute for Information and Communications Technology Planning and Evaluation IITP Grant funded by the Korea Government","award":["Grant 2017-0-00451","2017-0-01779"],"award-info":[{"award-number":["Grant 2017-0-00451","2017-0-01779"]}]},{"DOI":"10.13039\/501100006764","name":"Technische Universit\u00e4t Berlin","doi-asserted-by":"crossref","award":["10032745"],"award-info":[{"award-number":["10032745"]}],"id":[{"id":"10.13039\/501100006764","id-type":"DOI","asserted-by":"crossref"}]},{"name":"German Ministry for Education and Research BMBF","award":["01IS14013A-E","01GQ1115","01GQ0850"],"award-info":[{"award-number":["01IS14013A-E","01GQ1115","01GQ0850"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tnnls.2019.2934225","type":"journal-article","created":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T19:49:36Z","timestamp":1567712976000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing for Measure of Performance in Max-Margin Parsing"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0443-3164","authenticated-orcid":false,"given":"Alexander","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Shinichi","family":"Nakajima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5222-3631","authenticated-orcid":false,"given":"Nico","family":"Gornitz","sequence":"additional","affiliation":[]},{"given":"Klaus-Robert","family":"Muller","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3115\/1075096.1075150"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390195"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/0108053"},{"key":"ref30","first-page":"825","article-title":"Fast exact inference for recursive cardinality models","author":"tarlow","year":"2012","journal-title":"Proc 28th UAI"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.21236\/ADA273556"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.3115\/1118693.1118694"},{"key":"ref34","first-page":"812","article-title":"HOP-MAP: Efficient message passing with high order potentials","author":"tarlow","year":"2010","journal-title":"Proc 13th AISTATS"},{"journal-title":"Pattern Recognition and Machine Learning","year":"2006","author":"bishop","key":"ref10"},{"key":"ref11","first-page":"333","article-title":"Training a log-linear parser with loss functions via softmax-margin","author":"auli","year":"2011","journal-title":"Proc Conf Empirical Methods Natural Lang Process"},{"key":"ref12","first-page":"1","article-title":"Max-margin parsing","author":"taskar","year":"2004","journal-title":"Proc EMNLP"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2497149"},{"key":"ref14","first-page":"613","article-title":"PCFG models of linguistic tree representations","volume":"24","author":"johnson","year":"1998","journal-title":"Comput Linguistics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102464"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2281761"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04898-2_616"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1249"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1257"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1973.9030"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3115\/1219840.1219852"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200507"},{"key":"ref3","first-page":"1453","article-title":"Large margin methods for structured and interdependent output variables","volume":"6","author":"tsochantaridis","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref6","first-page":"1377","article-title":"Bundle methods for machine learning","author":"smola","year":"2007","journal-title":"Proc 21st Adv Conf NIPS"},{"journal-title":"Probabilistic Graphical Models—Principles and Techniques","year":"2009","author":"koller","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1973.9030"},{"key":"ref7","first-page":"53","article-title":"Block-coordinate Frank-Wolfe optimization for structural SVMs","author":"lacoste-julien","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn (ICML)"},{"key":"ref2","first-page":"25","article-title":"Max-margin Markov networks","author":"taskar","year":"2003","journal-title":"Proc of 16th NIPS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)80007-X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2598721"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-2025"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1592761.1592783"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15552-9_42"},{"key":"ref23","first-page":"311","article-title":"Bundle methods for regularized risk minimization","volume":"11","author":"teo","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref26","first-page":"415","article-title":"Local computations with probabilities on graphical structures and their application to expert systems","author":"lauritzen","year":"1990","journal-title":"Readings in Uncertain Reasoning"},{"key":"ref25","first-page":"1212","article-title":"Structured output learning with high order loss functions","author":"tarlow","year":"2012","journal-title":"Proc 15th AISTATS"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/6104215\/08825553.pdf?arnumber=8825553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:19:32Z","timestamp":1651079972000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8825553\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/tnnls.2019.2934225","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2019]]}}}