ACM Home Page
Please provide us with feedback. Feedback
Learning boolean functions in an infinite attribute space
Full text PdfPdf (925 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-second annual ACM symposium on Theory of computing table of contents
Baltimore, Maryland, United States
Pages: 64 - 72  
Year of Publication: 1990
ISBN:0-89791-361-2
Author
A. Blum  MIT Laboratory for Computer Science, Cambridge, MA
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 10
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/100216.100224
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.

 
AHK89
 
Ang86
Dana Angluin. Learning regular sets from queries and counter-examples. Technical Report YALEU/DCS/TR-464, Yale University Department of Computer Science, March 1986.
 
Ang88
 
HKLW88
 
Kea89
 
KLPV87
Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant. Recent results on boolean concept learning. In Proceedings of the Fourth International Workshop on Machine Learning, pages 337-352, University of California, Irvine, June 1987.
 
Lit87
 
Lit89
 
Lit90
Nick Littlestone. private communication. 1990.
 
Riv87
Val84

CITED BY  10