On-line learning of binary and n-ary relations over multi-dimensional clusters

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On-line learning of binary and n-ary relations over multi-dimensional clusters

Full text

Pdf (899 KB)

Source

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

Santa Cruz, California, United States

Pages: 214 - 221

Year of Publication: 1995

ISBN:0-89791-723-5

Authors

Atsuyoshi Nakamura	Theory NEC Laboratory, RWCP, c/o C & C Research Laboratories, NEC Corporation, 4-1-1 Miyazaki Miyamae-ku, Kawasaki 216, Japan
Naoki Abe	Theory NEC Laboratory, RWCP, c/o C & C Research Laboratories, NEC Corporation, 4-1-1 Miyazaki Miyamae-ku, Kawasaki 216, Japan

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
University of California : University of California

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references 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/225298.225324 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	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	2	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]
	3	Sally A. Goldman , Manfred K. Warmuth, Learning binary relations using weighted majority voting, Proceedings of the sixth annual conference on Computational learning theory, p.453-462, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168396]
	4	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]
	5	Ronald L. Rivest , Robert Sloan, Learning complicated concepts reliably and usefully, Proceedings of the first annual workshop on Computational learning theory, p.69-79, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	6	Fernando Pereira , Naftali Tishby , Lillian Lee, Distributional clustering of English words, Proceedings of the 31st annual meeting on Association for Computational Linguistics, p.183-190, June 22-26, 1993, Columbus, Ohio [doi>10.3115/981574.981598]