skip to main content
10.1145/307400.307470acmconferencesArticle/Chapter ViewAbstractPublication PagescoltConference Proceedingsconference-collections
Article
Free Access

Further results on the margin distribution

Authors Info & Claims
Published:06 July 1999Publication History
First page image

References

  1. 1.Noga Alon, Shai Ben-David, Nicol6 Cesa-Bianchi and David Haussler, "Scale-sensitive Dimensions, Uniform Convergence, and Learnability," Journal of the ACM 44(4), (1997), 615-631.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Peter L. Bartlett, "The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network," IEEE Trans. Inf. Theory, 44(2), (1998), 525- 536.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Peter Bartlett and John Shawe-Taylor, Generalization- Performance of Support Vector Machines and Other Pattern Classifiers, In 'Advances in Kernel Methods - Support Vector Learning', Bernhard SchiSlkopf, Christopher J. C. Burges, and Alexander J. Smola (eds.), MIT Press, Cambridge, USA, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.C. Cortes and V. Vapnik, Support-Vector Networks, Machine Learning, 20(3), (1995) 273-297.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Nello Cristianini, John Shawe-Taylor, and Peter Sykacek, Bayesian Classifiers are Large Margin Hyperplanes in a Hilbert Space, in Shavlik, J., ed., Machine Learning: Proceedings of the Fifteenth International Conference, Morgan Kaufmann Publishers, San Francisco, CA.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis, New York: Wiley, 1973.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Yoav Freund and Robert E. Schapire, Large Margin Classification Using the Perceptron Algorithm, Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Leonid Gurvits, A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces. In Proceedings of Algorithm Learning Theory, ALT-97, and as NECI Technical Report, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Norbert Klasner and Hans Ulrich Simon, From Noise- Free to Noise-Tolerant and from On-line to Batch Learning, Proceedings of the Eighth Annual Conference on Computational Learning Theory, COLT'95, 1995, pp. 250-257.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.B. D. Ripley, Pattern Recognition and Neural Networks, Cambridge: Cambridge University Press, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.R. Schapire, Y. Freund, P. Bartlett, W. Sun Lee, Boosting the Margin: A New Explanation for the Effectiveness of Voting Methods. In D.H. Fisher, Jr., editor, Proceedings of International Conference on Machine Learning, ICML'97, pages 322-330, Nashville, Tennessee, July 1997. Morgan Kaufmann Publishers.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.John Shawe-Taylor, Peter L. Bartlett, Robert C. Williamson, Martin Anthony, Structural Risk Minimization over Data-Dependent Hierarchies, IEEE Trans. on Inf. Theory, 44 (5), (1998), 1926-1940.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.John Shawe-Taylor and Nello Cristianini, Margin Distribution Bounds on Generalization, Proceedings of EuroCOLT'99, Lecture notes in Artificial Intelligence, 1572, 1999, pp. 263-273.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.John Shawe-Taylor and Robert C. Williamson, Generalization Performance of Classifiers in Terms of Observed Covering Numbers, Proceedings of Euro- COLT'99, Lecture notes in Artificial Intelligence, 1572, 1999, pp. 274-284.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Further results on the margin distribution

      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
      • Published in

        cover image ACM Conferences
        COLT '99: Proceedings of the twelfth annual conference on Computational learning theory
        July 1999
        333 pages
        ISBN:1581131674
        DOI:10.1145/307400

        Copyright © 1999 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: 6 July 1999

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        COLT '99 Paper Acceptance Rate35of71submissions,49%Overall Acceptance Rate35of71submissions,49%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader