Learning binary relations using weighted majority voting

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Learning binary relations using weighted majority voting

Full text

Pdf (855 KB)

Source

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

Santa Cruz, California, United States

Pages: 453 - 462

Year of Publication: 1993

ISBN:0-89791-611-5

Authors

Sally A. Goldman
Manfred K. Warmuth

Sponsors

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): 14, Downloads (12 Months): 24, Citation Count: 2

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/168304.168396 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.

	Ang88	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	BF72	J. Barzdin and R. Freivald. On the prediction of general recursive functions. Soviet Mathematics Doklady, 13:1224-1228, 1972.
	CBFH+93	Nicolò Cesa-Bianchi , Yoav Freund , David P. Helmbold , David Haussler , Robert E. Schapire , Manfred K. Warmuth, How to use expert advice, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.382-391, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167198]
	Che92	William Chen, 1992. Personal communication.
	GRS89	Sally A. Goldman , Ronald L. Rivest , Robert E. Schapire, Learning binary relations and total orders, SIAM Journal on Computing, v.22 n.5, p.1006-1034, Oct. 1993 [doi>10.1137/0222062]
	Lit88	Nick Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm, Machine Learning, v.2 n.4, p.285-318, April 1988 [doi>10.1023/A:1022869011914]
	Lit89	N. Littlestone, Mistake bounds and logarithmic linear-threshold learning algorithms, University of California at Santa Cruz, Santa Cruz, CA, 1990
	LLW91	Nicholas Littlestone , Philip M. Long , Manfred K. Warmuth, On-line learning of linear functions, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.465-475, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103467]
	LW89	Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. In 30th Annual Symposium on Foundations of Computer Science, pages 256-261, October 1989. To appear in Information and Computation.
	Vov90	Volodimir G. Vovk, Aggregating strategies, Proceedings of the third annual workshop on Computational learning theory, p.371-386, August 06-08, 1990, Rochester, New York, United States

CITED BY 2

	Atsuyoshi Nakamura , Naoki Abe, On-line learning of binary and n-ary relations over multi-dimensional clusters, Proceedings of the eighth annual conference on Computational learning theory, p.214-221, July 05-08, 1995, Santa Cruz, California, United States
	Sung Young Jung , Jeong-Hee Hong , Taek-Soo Kim, A Statistical Model for User Preference, IEEE Transactions on Knowledge and Data Engineering, v.17 n.6, p.834-843, June 2005