Maximum margin algorithms with boolean kernels

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2777, Issue , 2003, Pages 87-101

  Khardon, Roni ^a   Servedio, Rocco A ^b  

^a Tufts University   (United States)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FUNCTIONS; LEARNING SYSTEMS; PERSONNEL TRAINING; POLYNOMIALS; RISK ASSESSMENT; VECTORS;

BOOLEAN KERNELS; LINEAR SEPARATORS; STRUCTURAL RISK MINIMIZATION (SRM); SUPPORT VECTOR MACHINES (SVM); BOOLEAN FEATURES; CLASS HIERARCHIES; DISJUNCTIVE NORMAL FORM; MAXIMUM MARGIN; PAC LEARNING MODEL; STRUCTURAL RISK MINIMIZATION; TARGET FUNCTIONS; UNIFORM DISTRIBUTION;

BOOLEAN FUNCTIONS; LEARNING ALGORITHMS;

EID: 9444284286     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45167-9_8     Document Type: Conference Paper

References (26)

1. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich. Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In Proceedings of the Twenty-Sixth Annual Symposium on Theory of Computing, pages 253-262, 1994.
2. A. Blum and S. Rudich. Fast learning of k-term DNF formulas with queries. Journal of Computer and System Sciences, 51(3):367-373, 1995.
3. B. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classifiers. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pages 144-152, 1992.
4. N. Bshouty. A subexponential exact learning algorithm for DNF using equivalence queries. Information Processing Letters, 59:37-39, 1996.
5. N. Bshouty and C. Tamon. On the Fourier spectrum of monotone functions. Journal of the ACM, 43(4):747-770, 1996.
6. C. Gentile. A new approximate maximal margin classification algorithm. Journal of Machine Learning Research, 2:213-242, 2001.
7. T. Hancock and Y. Mansour. Learning monotone k-μ DNF formulas on product distributions. In Proceedings of the Fourth Annual Conference on Computational Learning Theory, pages 179-193, 1991.
8. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55:414-440, 1997.
9. M. Kearns and U. Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, MA, 1994.
10. R. Khardon. On using the Fourier transform to learn disjoint DNF. Information Processing Letters, 49:219-222, 1994.
11. R. Khardon, D. Roth, and R. Servedio. Efficiency versus convergence of boolean kernels for on-line learning algorithms. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
12. °(n1/3). In Proceedings of the Thirty-Third Annual Symposium on Theory of Computing, pages 258-265, 2001.
13. A. Kowalczyk, A. J. Smola, and R. C. Williamson. Kernel machines and boolean functions. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002, MIT Press.
14. L. Kucera, A. Marchetti-Spaccamela, and M. Protassi. On learning monotone DNF formulae under uniform distributions. Information and Computation, 110:84-95, 1994.
15. E. Kushilevitz and D. Roth. On learning visual concepts and DNF formulae. In Proceedings of the Sixth Annual Conference on Computational Learning Theory, pages 317-326, 1993.
16. M. Minsky and S. Papert. Perceptrons: an introduction to computational geometry. MIT Press, Cambridge, MA, 1968.
17. K. Sadohara. Learning of boolean functions using support vector machines. In Proc. of the 12th International Conference on Algorithmic Learning Theory, pages 106-118. Springer, 2001. LNAI 2225.
18. Y. Sakai and A. Maruoka. Learning monotone log-term DNF formulas under the uniform distribution. Theory of Computing Systems, 33:17-33, 2000.
19. R. Servedio. On PAC learning using winnow, perceptron, and a perceptron-like algorithm. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory, pages 296-307, 1999.
20. R. Servedio. On learning monotone DNF under product distributions. In Proceedings of the Fourteenth Annual Conference on Computational Learning Theory, pages 473-489, 2001.
21. J. Shawe-Taylor and N. Cristianini. An introduction to support vector machines. Cambridge University Press, 2000.
22. J. Tarui and T. Tsukiji. Learning DNF by approximating inclusion-exclusion formulae. In Proceedings of the Fourteenth Conference on Computational Complexity, pages 215-220, 1999.
23. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
24. K. Verbeurgt. Learning DNF under the uniform distribution in quasi-polynomial time. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 314-326, 1990.
25. K. Verbeurgt. Learning sub-classes of monotone DNF on the uniform distribution. In Proceedings of the Ninth Conference on Algorithmic Learning Theory, pages 385-399, 1998.
26. C. Watkins. Kernels from matching operations. Technical Report CSD-TR-98-07, Computer Science Department, Royal Holloway, University of London, 1999.