Drifting games

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Drifting games

Full text

Pdf (1.11 MB)

Source

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

Santa Cruz, California, United States

Pages: 114 - 124

Year of Publication: 1999

ISBN:1-58113-167-4

Author

Robert E. Schapire

AT&T Labs, Shannon Laboratory, 180 Park Avenue, Room A279, Florham Park, NJ

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Univ. of California, : University of California at Santa Cruz

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 17, Citation Count: 3

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/307400.307421 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	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]
	2	Nicolò Cesa-Bianchi , Yoav Freund , David P. Helmbold , Manfred K. Warmuth, On-line prediction and conversion strategies, Machine Learning, v.25 n.1, p.71-110, Oct. 1996 [doi>10.1023/A:1018348209754]
	3	Yoav Freund, Boosting a weak learning algorithm by majority, Information and Computation, v.121 n.2, p.256-285, Sept. 1995 [doi>10.1006/inco.1995.1136]
	4	Yoav Freund, An adaptive version of the boost by majority algorithm, Proceedings of the twelfth annual conference on Computational learning theory, p.102-113, July 07-09, 1999, Santa Cruz, California, United States [doi>10.1145/307400.307419]
	5	Yoav Freund , Robert E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and System Sciences, v.55 n.1, p.119-139, Aug. 1997 [doi>10.1006/jcss.1997.1504]
	6	Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301): 13-30, March 1963.
	7	Nick Littlestone , Manfred K. Warmuth, The weighted majority algorithm, Information and Computation, v.108 n.2, p.212-261, Feb. 1, 1994 [doi>10.1006/inco.1994.1009]
	8	Robert E. Schapire , Yoram Singer, Improved boosting algorithms using confidence-rated predictions, Proceedings of the eleventh annual conference on Computational learning theory, p.80-91, July 24-26, 1998, Madison, Wisconsin, United States [doi>10.1145/279943.279960]

CITED BY 3

	Nigel Duffy , David Helmbold, A geometric approach to leveraging weak learners, Theoretical Computer Science, v.284 n.1, p.67-108, 6 July 2002
	Roberto Esposito , Lorenza Saitta, A Monte Carlo analysis of ensemble classification, Proceedings of the twenty-first international conference on Machine learning, p.34, July 04-08, 2004, Banff, Alberta, Canada
	R. Servedio, PAC Analogues of Perceptron and Winnow Via Boosting the Margin, Machine Learning, v.47 n.2-3, p.133-151, May-June 2002