Large margin classification using the perceptron algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Large margin classification using the perceptron algorithm

Full text

Pdf (1.11 MB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the eleventh annual conference on Computational learning theory table of contents

Madison, Wisconsin, United States

Pages: 209 - 217

Year of Publication: 1998

ISBN:1-58113-057-0

Authors

Yoav Freund	AT&T Labs, 180 Park Avenue, Florham Park, NJ
Robert E. Schapire	AT&T Labs, 180 Park Avenue, Florham Park, NJ

Sponsors

University of Wisconsin : University of Wisconsin
UC @ Santa Cruz : UC @ Santa Cruz
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 30, Citation Count: 27

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/279943.279985 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. A. Aizerman, E. M. Braverman, and L. I. Rozonoer. Theoretical foundations of the potential function method in pattern recognition learning. Automation and Remote Control, 25: 821-837, 1964.
	2	H. D. Block, The perceptron: a model for brain functioning. I, Neurocomputing: foundations of research, MIT Press, Cambridge, MA, 1988
	3	Bernhard E. Boser , Isabelle M. Guyon , Vladimir N. Vapnik, A training algorithm for optimal margin classifiers, Proceedings of the fifth annual workshop on Computational learning theory, p.144-152, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130401]
	4	Nicolò Cesa-Bianchi , Yoav Freund , David Haussler , David P. Helmbold , Robert E. Schapire , Manfred K. Warmuth, How to use expert advice, Journal of the ACM (JACM), v.44 n.3, p.427-485, May 1997 [doi>10.1145/258128.258179]
	5	Corinna Cortes , Vladimir Vapnik, Support-Vector Networks, Machine Learning, v.20 n.3, p.273-297, Sept. 1995 [doi>10.1023/A:1022627411411]
	6	S. I. Gallant. Optimal linear discriminants. In Eighth International Conference on Pattern Recognition,pages 849-852. IEEE, 1986.
	7	David P. Helmbold , Manfred K. Warmuth, On weak learning, Journal of Computer and System Sciences, v.50 n.3, p.551-573, June 1995 [doi>10.1006/jcss.1995.1044]
	8	Jyrki Kivinen , Manfred K. Warmuth, Exponentiated gradient versus gradient descent for linear predictors, Information and Computation, v.132 n.1, p.1-63, Jan. 10, 1997 [doi>10.1006/inco.1996.2612]
	9	Norbert Klasner , 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, p.250-257, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225328]
	10	Y. LeCun, L. D. Jackel, L. Bottou, A. Brunot, C. Cortes, J. S. Denker, H. Drucker, I. Guyon, U. A. Muller, E. Sackinger, E Simard, and V Vapnik. Comparison of learning algorithms for handwritten digit recognition. In International Conference on Artificial Neural Networks, pages 53-60, 1995.
	11	Nick Littlestone, From on-line to batch learning, Proceedings of the second annual workshop on Computational learning theory, p.269-284, December 1989, Santa Cruz, California, United States
	12	Perceptrons: An Introduction to Computational Geometry, The MIT Press, 1969
	13	A. B. J. Novikoff. On convergence proofs on perceptrons. In Proceedings of the Symposium on the Mathematical Theory of Automata, volume XII, pages 615- 622, 1962.
	14	F. Rosenblatt, The perception: a probabilistic model for information storage and organization in the brain, Neurocomputing: foundations of research, MIT Press, Cambridge, MA, 1988
	15	E Rosenblatt. Principles of Neurodynamics. Spartan, New York, 1962.
	16	Vladimir Vapnik, Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics), Springer-Verlag New York, Inc., Secaucus, NJ, 1982
	17	V. N. Vapnik and A. Ya. Chervonenkis. Theory ofpattern recognition. Nauka, Moscow, 1974. (In Russian).
	18	Vladimir N. Vapnik. StatisticalLearning Theory. Wiley, 1998 (to appear).

CITED BY 27

	Adam R. Klivans , Rocco Servedio, Learning DNF in time, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.258-265, July 2001, Hersonissos, Greece
	Claudio Gentile , Nick Littlestone, The robustness of the p-norm algorithms, Proceedings of the twelfth annual conference on Computational learning theory, p.1-11, July 07-09, 1999, Santa Cruz, California, United States
	John Shawe-Taylor , Nello Cristianini, Further results on the margin distribution, Proceedings of the twelfth annual conference on Computational learning theory, p.278-285, July 07-09, 1999, Santa Cruz, California, United States
	Ying Lu , Jiawei Han, Cancer classification using gene expression data, Information Systems, v.28 n.4, p.243-268, June 2003
	Koby Crammer , Yoram Singer, A new family of online algorithms for category ranking, Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, August 11-15, 2002, Tampere, Finland
	Adam R. Klivans , Rocco A. Servedio, Learning DNF in time 2^{õ(n^1/3)}, Journal of Computer and System Sciences, v.68 n.2, p.303-318, March 2004
	Rocco A. Servedio, On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm, Proceedings of the twelfth annual conference on Computational learning theory, p.296-307, July 07-09, 1999, Santa Cruz, California, United States
	Yoram Gat, A Learning Generalization Bound with an Application to Sparse-Representation Classifiers, Machine Learning, v.42 n.3, p.233-239, March 2001
	Dan Roth , Ming-Hsuan Yang , Narendra Ahuja, Learning to recognize three-dimensional objects, Neural Computation, v.14 n.5, p.1071-1103, May 2002
	Yi Li , Philip M. Long , Aravind Srinivasan, Improved bounds on the sample complexity of learning, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.309-318, January 09-11, 2000, San Francisco, California, United States
	William W. Cohen , Sunita Sarawagi, Exploiting dictionaries in named entity extraction: combining semi-Markov extraction processes and data integration methods, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
	Dan Roth, Learning in natural language: theory and algorithmic approaches, Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning, September 13-14, 2000, Lisbon, Portugal
	Rocco A. Servedio, Smooth boosting and learning with malicious noise, The Journal of Machine Learning Research, 4, p.633-648, 12/1/2003
	Yi Li , Philip M. Long, The Relaxed Online Maximum Margin Algorithm, Machine Learning, v.46 n.1-3, p.361-387, 2002
	Pascal Vincent , Yoshua Bengio, Kernel Matching Pursuit, Machine Learning, v.48 n.1-3, p.165-187, 2002
	Chi-Chun Huang , Hahn-Ming Lee, A Grey-Based Nearest Neighbor Approach for Missing Attribute Value Prediction, Applied Intelligence, v.20 n.3, p.239-252, May-June 2004
	Roy W. Tromble , Jason Eisner, A fast finite-state relaxation method for enforcing global constraints on sequence decoding, Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, p.423-430, June 04-09, 2006, New York, New York
	Wanxiang Che , Min Zhang , Ting Liu , Sheng Li, A hybrid convolution tree kernel for semantic role labeling, Proceedings of the COLING/ACL on Main conference poster sessions, p.73-80, July 17-18, 2006, Sydney, Australia
	James Henderson , Ivan Titov, Data-defined kernels for parse reranking derived from probabilistic models, Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, p.181-188, June 25-30, 2005, Ann Arbor, Michigan
	Adam R. Klivans , Rocco A. Servedio, Learning intersections of halfspaces with a margin, Journal of Computer and System Sciences, v.74 n.1, p.35-48, February, 2008
	Peter Geibel , Fritz Wysotzki, Learning Perceptrons and Piecewise Linear Classifiers Sensitive to Example Dependent Costs, Applied Intelligence, v.21 n.1, p.45-56, July-August 2004
	Jason Weston , André Elisseeff , Bernhard Schölkopf , Mike Tipping, Use of the zero norm with linear models and kernel methods, The Journal of Machine Learning Research, 3, 3/1/2003
	Koby Crammer , Yoram Singer, A family of additive online algorithms for category ranking, The Journal of Machine Learning Research, 3, 3/1/2003
	Wael Al-Sawalmeh , Khaled Daqrouq , Abdel-Rahman Al-Qawasmi , Tareq Abu Hilal, The use of wavelets in speaker feature tracking identification system using neural network, WSEAS Transactions on Signal Processing, v.5 n.5, p.167-177, May 2009
	Dan Goldwasser , Dan Roth, Active sample selection for named entity transliteration, Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers, June 16-17, 2008, Columbus, Ohio
	William W. Cohen , Vitor R. Carvalho, Stacked sequential learning, Proceedings of the 19th international joint conference on Artificial intelligence, p.671-676, July 30-August 05, 2005, Edinburgh, Scotland
	William W. Cohen , Einat Minkov , Anthony Tomasic, Learning to understand web site update requests, Proceedings of the 19th international joint conference on Artificial intelligence, p.1028-1033, July 30-August 05, 2005, Edinburgh, Scotland