{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T16:12:28Z","timestamp":1790007148165,"version":"4.0.1"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"11","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2009,11]]},"abstract":"<jats:p>Machine Learning today offers a broad repertoire of methods for classification and regression. But what if we need to predict complex objects like trees, orderings, or alignments? Such problems arise naturally in natural language processing, search engines, and bioinformatics. The following explores a generalization of Support Vector Machines (SVMs) for such complex prediction problems.<\/jats:p>","DOI":"10.1145\/1592761.1592783","type":"journal-article","created":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T13:28:14Z","timestamp":1256650094000},"page":"97-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Predicting structured objects with support vector machines"],"prefix":"10.1145","volume":"52","author":[{"given":"Thorsten","family":"Joachims","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Hofmann","sequence":"additional","affiliation":[{"name":"Google Inc., Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yisong","family":"Yue","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chun-Nam","family":"Yu","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,11]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","year":"1999","unstructured":"Baeza-Yates , R. , Ribeiro-Neto , B. Modern Information Retrieval . Addison-Wesley-Longman , Harlow, UK ( May 1999 ). Baeza-Yates, R., Ribeiro-Neto, B. Modern Information Retrieval. Addison-Wesley-Longman, Harlow, UK (May 1999)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031186"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401906"},{"key":"e_1_2_1_4_1","volume-title":"NIPS Workshop on Machine Learning for Web Search","author":"Chapelle O.","year":"2007","unstructured":"Chapelle , O. , Le , Q. , Smola , A. Large margin optimization of ranking measures . In NIPS Workshop on Machine Learning for Web Search ( 2007 ). Chapelle, O., Le, Q., Smola, A. Large margin optimization of ranking measures. In NIPS Workshop on Machine Learning for Web Search (2007)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3115\/1118693.1118694"},{"key":"e_1_2_1_6_1","volume-title":"On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res. (JMLR) 2","author":"Crammer K.","year":"2001","unstructured":"Crammer , K. , Singer , Y. On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res. (JMLR) 2 ( 2001 ), 265--292. Crammer, K., Singer, Y. On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res. (JMLR) 2 (2001), 265--292."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102379"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390195"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning","author":"Hastie T.","year":"2001","unstructured":"Hastie , T. , Tibshirani , R. , Friedman , J. The Elements of Statistical Learning . Springer ( 2001 ). Hastie, T., Tibshirani, R., Friedman, J. The Elements of Statistical Learning. Springer (2001)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000677"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0907-3","volume-title":"Learning to Classify Text Using Support Vector Machines - Methods, Theory, and Algorithms","author":"Joachims T.","year":"2002","unstructured":"Joachims , T. Learning to Classify Text Using Support Vector Machines - Methods, Theory, and Algorithms . Kluwer\/Springer ( 2002 ). Joachims, T. Learning to Classify Text Using Support Vector Machines - Methods, Theory, and Algorithms. Kluwer\/Springer (2002)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_2_1_16_1","volume-title":"International Conference on Machine Learning (ICML)","author":"Lafferty J.","year":"2001","unstructured":"Lafferty , J. , McCallum , A. , Pereira , F. Conditional random fields: Probabilistic models for segmenting and labeling sequence data . In International Conference on Machine Learning (ICML) ( 2001 ). Lafferty, J., McCallum, A., Pereira, F. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In International Conference on Machine Learning (ICML) (2001)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_2_1_18_1","volume-title":"International Conference on Machine Learning (ICML)","author":"McCallum A.","year":"2000","unstructured":"McCallum , A. , Freitag , D. , Pereira , F. Maximum entropy Markov models for information extraction and segmentation . In International Conference on Machine Learning (ICML) ( 2000 ), 591--598. McCallum, A., Freitag, D., Pereira, F. Maximum entropy Markov models for information extraction and segmentation. In International Conference on Machine Learning (ICML) (2000), 591--598."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/prot.1145"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/prot.20854"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of TREC-3","author":"Robertson S.","year":"1994","unstructured":"Robertson , S. , Walker , S. , Jones , S. , Hancock-Beaulieu , M. , Gatford , M. Okapi at TREC-3 . In Proceedings of TREC-3 ( 1994 ). Robertson, S., Walker, S., Jones, S., Hancock-Beaulieu, M., Gatford, M. Okapi at TREC-3. In Proceedings of TREC-3 (1994)."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3115\/1073445.1073473"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/protein\/11.9.739"},{"key":"e_1_2_1_25_1","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Taskar B.","year":"2003","unstructured":"Taskar , B. , Guestrin , C. , Koller , D. Maximum-margin markov networks . In Advances in Neural Information Processing Systems (NIPS) ( 2003 ). Taskar, B., Guestrin, C., Koller, D. Maximum-margin markov networks. In Advances in Neural Information Processing Systems (NIPS) (2003)."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015341"},{"key":"e_1_2_1_27_1","volume-title":"Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res. (JMLR), 6 (September","author":"Tsochantaridis I.","year":"2005","unstructured":"Tsochantaridis , I. , Joachims , T. , Hofmann , T. , Altun , Y. Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res. (JMLR), 6 (September 2005 ), 1453--1484. Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y. Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res. (JMLR), 6 (September 2005), 1453--1484."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401985"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.0152"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277790"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390310"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860440"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gki524"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1592761.1592783","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1592761.1592783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:18Z","timestamp":1750249398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1592761.1592783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":32,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["10.1145\/1592761.1592783"],"URL":"https:\/\/doi.org\/10.1145\/1592761.1592783","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]},"assertion":[{"value":"2009-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}