{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T16:10:09Z","timestamp":1744733409345,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341557"},{"type":"electronic","value":"9783642341564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34156-4_30","type":"book-chapter","created":{"date-parts":[[2012,10,20]],"date-time":"2012-10-20T04:50:18Z","timestamp":1350708618000},"page":"324-333","source":"Crossref","is-referenced-by-count":1,"title":["Applying Piecewise Approximation in Perceptron Training of Conditional Random Fields"],"prefix":"10.1007","author":[{"given":"Teemu","family":"Ruokolainen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Lafferty, J., McCallum, A., Pereira, F.C.N.: Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In: Proceedings of the Eighteenth International Conference on Machine Learning, pp. 282\u2013289 (2001)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Collins, M.: Discriminative training methods for hidden markov models: Theory and Experiments with Perceptron Algorithms. In: Proceedings of the ACL 2002 Conference on Empirical Methods in Natural Language Processing, vol.\u00a010, pp. 1\u20138. Association for Computational Linguistics (2002)","DOI":"10.3115\/1118693.1118694"},{"key":"30_CR3","first-page":"1453","volume":"6","author":"I. Tsochantaridis","year":"2005","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y.: Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research\u00a06, 1453\u20131484 (2005)","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1162\/coli_a_00037","volume":"37","author":"Y. Zhang","year":"2011","unstructured":"Zhang, Y., Clark, S.: Syntactic processing using the generalized perceptron and beam search. Computational Linguistics\u00a037(1), 105\u2013151 (2011)","journal-title":"Computational Linguistics"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10994-009-5112-z","volume":"77","author":"C. Sutton","year":"2009","unstructured":"Sutton, C., McCallum, A.: Piecewise training for structured prediction. Machine Learning\u00a077(2), 165\u2013194 (2009)","journal-title":"Machine Learning"},{"key":"30_CR6","unstructured":"Sontag, D., Meshi, O., Jaakkola, T., Globerson, A.: More data means less inference: A pseudo-max approach to structured learning. In: Lafferty, J., Williams, C.K.I., Shawe-Taylor, J., Zemel, R., Culotta, A. (eds.) Advances in Neural Information Processing Systems 23, pp. 2181\u20132189 (2010)"},{"key":"30_CR7","unstructured":"Samdani, R., Roth, D.: Efficient decomposed learning for structured prediction. In: Proceedings of the 29th International Conference on Machine Learning (2012)"},{"key":"30_CR8","unstructured":"Srikumar, V., Kundu, G., Roth, D.: On amortizing inference cost for structured prediction. In: Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 1114\u20131124 (2012)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1109\/72.788640","volume":"10","author":"V. Vapnik","year":"1999","unstructured":"Vapnik, V.: An overview of statistical learning theory. IEEE Transactions on Neural Networks\u00a010, 988\u2013999 (1999)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1023\/A:1007662407062","volume":"37","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.: Large margin classification using the perceptron algorithm. Machine Learning\u00a037(3), 277\u2013296 (1999)","journal-title":"Machine Learning"},{"key":"30_CR11","unstructured":"Daum\u00e9 III, H.: Practical structured learning techniques for natural language processing. PhD thesis, University of Southern California (2006)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Kim, T., Sang, E., Buchholz, S.: Introduction to the conll-2000 shared task: Chunking. In: Proceedings of the 2nd Workshop on Learning Language in Logic and the 4th Conference on Computational Natural Language Learning, vol.\u00a07, pp. 127\u2013132. Association for Computational Linguistics (2000)","DOI":"10.3115\/1117601.1117631"},{"issue":"2","key":"30_CR13","first-page":"313","volume":"19","author":"M. Marcus","year":"1993","unstructured":"Marcus, M., Marcinkiewicz, M., Santorini, B.: Building a large annotated corpus of english: The penn treebank. Computational Linguistics\u00a019(2), 313\u2013330 (1993)","journal-title":"Computational Linguistics"},{"key":"30_CR14","volume-title":"Pattern recognition and machine learning","author":"C. Bishop","year":"2006","unstructured":"Bishop, C.: Pattern recognition and machine learning, vol.\u00a04. Springer, New York (2006)"},{"key":"30_CR15","unstructured":"Frey, B., MacKay, D.: A revolution: Belief propagation in graphs with cycles. Advances in Neural Information Processing Systems, 479\u2013485 (1998)"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M.J. Wainwright","year":"2005","unstructured":"Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: Map estimation via agreement on trees: message-passing and linear programming. IEEE Transactions on Information Theory\u00a051, 3697\u20133717 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a023, 1222\u20131239 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34156-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T15:28:44Z","timestamp":1744730924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34156-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341557","9783642341564"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34156-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}