{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T09:55:21Z","timestamp":1720778121323},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2009,7,23]],"date-time":"2009-07-23T00:00:00Z","timestamp":1248307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10994-009-5129-3","type":"journal-article","created":{"date-parts":[[2009,7,22]],"date-time":"2009-07-22T14:09:38Z","timestamp":1248271778000},"page":"227-242","source":"Crossref","is-referenced-by-count":13,"title":["On structured output training: hard cases and\u00a0an\u00a0efficient alternative"],"prefix":"10.1007","volume":"76","author":[{"given":"Thomas","family":"G\u00e4rtner","sequence":"first","affiliation":[]},{"given":"Shankar","family":"Vembu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,23]]},"reference":[{"key":"5129_CR1","unstructured":"Altun,\u00a0Y., Hofmann,\u00a0T., & Johnson,\u00a0M. (2002). Discriminative learning for label sequences via boosting. In Advances in neural information processing systems (Vol.\u00a015)."},{"key":"5129_CR2","doi-asserted-by":"crossref","unstructured":"Bakir,\u00a0G., Zien,\u00a0A., & Tsuda,\u00a0K. (2004). Learning to find graph pre-images. In Proceedings of the annual symposium of the German association for pattern recognition (DAGM).","DOI":"10.1007\/978-3-540-28649-3_31"},{"key":"5129_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund,\u00a0A., Husfeldt,\u00a0T., & Khanna,\u00a0S. (2004). Approximating longest directed paths and cycles. In Proceedings of the international colloquium on automata, languages and programming.","DOI":"10.1007\/978-3-540-27836-8_21"},{"key":"5129_CR4","unstructured":"Cesa-Bianchi,\u00a0N., Gentile,\u00a0C., Tironi,\u00a0A., & Zaniboni,\u00a0L. (2004). Incremental algorithms for hierarchical classification. In Advances in Neural Information Processing Systems (Vol.\u00a017)."},{"key":"5129_CR5","doi-asserted-by":"crossref","unstructured":"Collins,\u00a0M. (2002). Discriminative training methods for hidden Markov models: theory and experiments with perceptron algorithms. In Proceedings of the conference on empirical methods in natural language processing.","DOI":"10.3115\/1118693.1118694"},{"key":"5129_CR6","doi-asserted-by":"crossref","unstructured":"Cortes,\u00a0C., Mohri,\u00a0M., & Weston,\u00a0J. (2005). A\u00a0general regression technique for learning transductions. In Proceedings of the international conference on machine learning.","DOI":"10.1145\/1102351.1102371"},{"key":"5129_CR7","doi-asserted-by":"crossref","unstructured":"Daum\u00e9,\u00a0H. III, & Marcu,\u00a0D. (2005). Learning as search optimization: approximate large margin methods for structured prediction. In Proceedings of the international conference on machine learning.","DOI":"10.1145\/1102351.1102373"},{"key":"5129_CR8","unstructured":"Elisseeff,\u00a0A., & Weston,\u00a0J. (2001). A\u00a0kernel method for multi-labelled classification. In Advances in neural information processing systems (Vol.\u00a014)."},{"issue":"2","key":"5129_CR9","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1021\/ci050367t","volume":"46","author":"D. Erhan","year":"2006","unstructured":"Erhan,\u00a0D., L\u2019heureux, P. J., Yue, S. Y., & Bengio,\u00a0Y. (2006). Collaborative filtering on a family of biological targets. Journal of Chemical Information and Modeling, 46(2), 626\u2013635.","journal-title":"Journal of Chemical Information and Modeling"},{"key":"5129_CR10","doi-asserted-by":"crossref","unstructured":"Finley,\u00a0T., & Joachims,\u00a0T. (2008). Training structural SVMs when exact inference is intractable. In Proceedings of the international conference on machine learning.","DOI":"10.1145\/1390156.1390195"},{"key":"5129_CR11","doi-asserted-by":"crossref","unstructured":"Froehlich,\u00a0J., & Krumm,\u00a0J. (2008). Route prediction from trip observations. In Society of automotive engineers world congress.","DOI":"10.4271\/2008-01-0201"},{"key":"5129_CR12","unstructured":"G\u00e4rtner,\u00a0T., & Vembu,\u00a0S. (2008). Learning to predict combinatorial structures. Unpublished manuscript."},{"key":"5129_CR13","doi-asserted-by":"crossref","unstructured":"Guruswami,\u00a0V., Manokaran,\u00a0R., & Raghavendra,\u00a0P. (2008). Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph. In Proceedings of the annual IEEE symposium on foundations of computer science.","DOI":"10.1109\/FOCS.2008.51"},{"issue":"19","key":"5129_CR14","doi-asserted-by":"crossref","first-page":"2149","DOI":"10.1093\/bioinformatics\/btn409","volume":"24","author":"L. Jacob","year":"2008","unstructured":"Jacob,\u00a0L., & Vert, J. P. (2008). Protein-ligand interaction prediction: an improved chemogenomics approach. Bioinformatics, 24(19), 2149\u20132156.","journal-title":"Bioinformatics"},{"key":"5129_CR15","first-page":"482","volume-title":"Approximation algorithms for NP-hard problems","author":"M. Jerrum","year":"1996","unstructured":"Jerrum,\u00a0M., & Sinclair,\u00a0A. (1996). The Markov chain Monte Carlo method: an approach to approximate counting and integration. In D. S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 482\u2013520). Boston: PWS-Kent."},{"issue":"2","key":"5129_CR16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/moor.1060.0194","volume":"31","author":"A. T. Kalai","year":"2006","unstructured":"Kalai, A. T., & Vempala,\u00a0S. (2006). Simulated annealing for convex optimization. Mathematics of Operations Research, 31(2), 253\u2013266.","journal-title":"Mathematics of Operations Research"},{"key":"5129_CR17","series-title":"Algorithms and combinatorics","volume-title":"Combinatorial optimization: theory and algorithms","author":"B. Korte","year":"2008","unstructured":"Korte,\u00a0B., & Vygen,\u00a0J. (2008). Algorithms and combinatorics: Vol. 21. Combinatorial optimization: theory and algorithms. Berlin: Springer."},{"key":"5129_CR18","volume-title":"Computational complexity","author":"C. H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. H. (1994). Computational complexity. Addison-Wesley: Reading"},{"key":"5129_CR19","unstructured":"Randall,\u00a0D. (2003). Mixing. In Proceedings of the annual IEEE symposium on foundations of computer sciences."},{"key":"5129_CR20","doi-asserted-by":"crossref","unstructured":"Ricci,\u00a0E., Bie, T. D., & Cristianini,\u00a0N. (2007). Discriminative sequence labeling by Z-score optimization. In Proceedings of the European conference on machine learning.","DOI":"10.1007\/978-3-540-74958-5_27"},{"key":"5129_CR21","first-page":"2803","volume":"9","author":"E. Ricci","year":"2008","unstructured":"Ricci,\u00a0E., Bie, T. D., & Cristianini,\u00a0N. (2008). Magic moments for structured output prediction. Journal of Machine Learning Research, 9, 2803\u20132846.","journal-title":"Journal of Machine Learning Research"},{"key":"5129_CR22","doi-asserted-by":"crossref","unstructured":"Rousu,\u00a0J., Saunders,\u00a0C., Szedm\u00e1k,\u00a0S., & Shawe-Taylor,\u00a0J. (2005). Learning hierarchical multi-category text classification models. In Proceedings of the international conference on machine learning.","DOI":"10.1145\/1102351.1102445"},{"issue":"5","key":"5129_CR23","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/72.788641","volume":"10","author":"B. Sch\u00f6lkopf","year":"1999","unstructured":"Sch\u00f6lkopf,\u00a0B., Mika,\u00a0S., Burges, C. J. C., Knirsch,\u00a0P., M\u00fcller, K. R., R\u00e4tsch,\u00a0G., & Smola, A. J. (1999). Input space versus feature space in kernel-based methods. IEEE Transactions on Neural Networks, 10(5), 1000\u20131017.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"5129_CR24","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf,\u00a0B., Herbrich,\u00a0R., & Smola, A. J. (2001). A\u00a0generalized representer theorem. In Proceedings of the annual conference on learning theory.","DOI":"10.1007\/3-540-44581-1_27"},{"key":"5129_CR25","doi-asserted-by":"crossref","unstructured":"Suykens,\u00a0J. (1999). Multiclass least squares support vector machines. In Proceedings of the international joint conference on neural networks.","DOI":"10.1109\/IJCNN.1999.831072"},{"issue":"3","key":"5129_CR26","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1018628609742","volume":"9","author":"J. Suykens","year":"1999","unstructured":"Suykens,\u00a0J., & Vandewalle,\u00a0J. (1999). Least squares support vector machine classifiers. Neural Processing Letters, 9(3), 293\u2013300.","journal-title":"Neural Processing Letters"},{"key":"5129_CR27","doi-asserted-by":"crossref","unstructured":"Taskar,\u00a0B., Chatalbashev,\u00a0V., Koller,\u00a0D., & Guestrin,\u00a0C. (2005). Learning structured prediction models: A\u00a0large margin approach. In Proceedings of the international conference on machine learning.","DOI":"10.1145\/1102351.1102464"},{"key":"5129_CR28","first-page":"1453","volume":"6","author":"I. Tsochantaridis","year":"2005","unstructured":"Tsochantaridis,\u00a0I., Joachims,\u00a0T., Hofmann,\u00a0T., & Altun,\u00a0Y. (2005). Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6, 1453\u20131484.","journal-title":"Journal of Machine Learning Research"},{"key":"5129_CR29","unstructured":"Vembu,\u00a0S., G\u00e4rtner,\u00a0T., & Boley,\u00a0M. (2009). Probabilistic structured predictors. In Proceedings of the annual conference on uncertainty in artificial intelligence."},{"key":"5129_CR30","unstructured":"Weston,\u00a0J., Chapelle,\u00a0O., Elisseeff,\u00a0A., Sch\u00f6lkopf,\u00a0B., & Vapnik,\u00a0V. (2002). Kernel dependency estimation. In Advances in neural information processing systems (Vol.\u00a015)."},{"key":"5129_CR31","doi-asserted-by":"crossref","unstructured":"Yannakakis,\u00a0M. (1978). Node- and edge-deletion NP-complete problems. In Proceedings of the annual ACM symposium on theory of computing.","DOI":"10.1145\/800133.804355"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5129-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-009-5129-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5129-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:27Z","timestamp":1559353227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-009-5129-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,23]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["5129"],"URL":"https:\/\/doi.org\/10.1007\/s10994-009-5129-3","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,23]]}}}