skip to main content
research-article
Free Access

Predicting structured objects with support vector machines

Published:01 November 2009Publication History
Skip Abstract Section

Abstract

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.

References

  1. Baeza-Yates, R., Ribeiro-Neto, B. Modern Information Retrieval. Addison-Wesley-Longman, Harlow, UK (May 1999). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Cai, L., Hofmann, T. Hierarchical document categorization with support vector machines. In Proceedings of the ACM Conference on Information and Knowledge Management (CIKM) (2004). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Chakrabarti, S., Khanna, R., Sawant, U., Battacharyya, C. Structured learning for non-smooth ranking losses. In ACM Conference on Knowledge Discovery and Data Mining (KDD) (2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chapelle, O., Le, Q., Smola, A. Large margin optimization of ranking measures. In NIPS Workshop on Machine Learning for Web Search (2007).Google ScholarGoogle Scholar
  5. Collins, M. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Empirical Methods in Natural Language Processing (EMNLP) (2002), 1--8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Crammer, K., Singer, Y. On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res. (JMLR) 2 (2001), 265--292. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Finley, T., Joachims, T. Supervised clustering with support vector machines. In International Conference on Machine Learning (ICML) (2005), 217--224. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Finley, T., Joachims, T. Training structural SVMs when exact inference is intractable. In International Conference on Machine Learning (ICML) (2008), 304--311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Hastie, T., Tibshirani, R., Friedman, J. The Elements of Statistical Learning. Springer (2001).Google ScholarGoogle Scholar
  10. Hofmann, T., Schölkopf, B., Smola A.J. Kernel methods in machine learning. Ann. Stat. 36, 3 (2008), 1171--1220.Google ScholarGoogle ScholarCross RefCross Ref
  11. Joachims, T. Learning to Classify Text Using Support Vector Machines - Methods, Theory, and Algorithms. Kluwer/Springer (2002). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Joachims, T. A support vector method for mulivariate performance measures. In International Conference on Machine Learning (ICML) (2005), 377--384. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Joachims, T. Training linear SVMs in linear time. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) (2006), 217--226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Joachims, T., Finley, T., Yu, C.-N. Cutting-plane training of structural svms. Machine Learning Journal (2009) DOI 10.1007/S 10994-009-5108-8 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Khuller, S., Moss, A., Naor, J. The budgeted maximum coverage problem. Inform. Process. Lett. 70, 1 (1997), 39--45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. LeCun, Y., Bottou, L., Bengio, Y., Haffner, P. Gradient-based learning applied to document recognition. Proc. IEEE 86, 11 (1998), 2278--2324, November.Google ScholarGoogle ScholarCross RefCross Ref
  18. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Meller, J., Elber, R. Linear programming optimization and a double statistical filter for protein threading protocols. Proteins Struct. Funct. Genet. 45 (2001), 241--261.Google ScholarGoogle ScholarCross RefCross Ref
  20. Qiu, J., Elber, R. SSALN: an alignment algorithm using structure-dependent substitution matrices and gap penalties learned from structurally aligned protein pairs. Proteins 62 (2006), 881--91.Google ScholarGoogle ScholarCross RefCross Ref
  21. Robertson, S., Walker, S., Jones, S., Hancock-Beaulieu, M., Gatford, M. Okapi at TREC-3. In Proceedings of TREC-3 (1994).Google ScholarGoogle Scholar
  22. Sha, F., Pereira, F. Shallow parsing with conditional random fields. In NAACL'03: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology (Morristown, NJ, USA, 2003), 134--141. Association for Computational Linguistics. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Shindyalov, I.N., Bourne, P.E. Protein structure alignment by incremental combinatorial extension(CE) of the optimal path. Protein Eng. 11 (1998), 739--747.Google ScholarGoogle ScholarCross RefCross Ref
  24. Swaminathan, A., Mathew, C., Kirovski, D. Essential pages. Technical Report MSR-TR-2008--015, Microsoft Research (2008).Google ScholarGoogle Scholar
  25. Taskar, B., Guestrin, C., Koller, D. Maximum-margin markov networks. In Advances in Neural Information Processing Systems (NIPS) (2003).Google ScholarGoogle Scholar
  26. Tsochantaridis, I., Hofmann, T., Joachims, T., Altun, Y. Support vector machine learning for interdependent and structured output spaces. In International Conference on Machine Learning (ICML) (2004), 104--112. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Yu, C.-N.J., Joachims, T. Training structural svms with kernels using sampled cuts. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (2008), 794--802. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Yu, C.-N.J., Joachims, T., Elber, R., Pillardy, J. Support vector training of protein alignment models. J. Comput. Biol. 15, 7 (September 2008), 867--880.Google ScholarGoogle ScholarCross RefCross Ref
  30. Yue, Y., Finley, T., Radlinski, F., Joachims, T. A support vctor method for optimizing average precision. In ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) (2007), 271--278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Yue, Y., Joachims, T. Predicting diverse subsets using structural SVMs. In International Conference on Machine Learning (ICML) (2008), 271--278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Zhai, C., Cohen, W.W., Lafferty, J. Beyond independent relevance: Methods and evaluation metrics for subtopic retrieval. In Proceedings of the ACM Conference on Research and Development in Information Retrieval (SIGIR) (2003). Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Zhang, Y., Skolnick, J. TM-align: A protein structure alignment algorithm based on TM-score. Nucleic Acids Res. 33 (2005), 2302--2309.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Predicting structured objects with support vector machines

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image Communications of the ACM
        Communications of the ACM  Volume 52, Issue 11
        Scratch Programming for All
        November 2009
        135 pages
        ISSN:0001-0782
        EISSN:1557-7317
        DOI:10.1145/1592761
        Issue’s Table of Contents

        Copyright © 2009 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 November 2009

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Popular
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format