SIGN IN
SIGN UP
On the boosting ability of top-down decision tree learning algorithms
Full Text:
PDF
Buy this Article
Authors:
Michael Kearns
AT&T Research
Yishay Mansour
Tel-Aviv University
Published in:
· Proceeding
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Pages 459-468
ACM
New York, NY
, USA
©1996
table of contents
ISBN:0-89791-785-5
doi>
10.1145/237814.237994
1996 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 30
· Downloads (cumulative): 503
· Citation Count: 34
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
complexity measures and classes
learning
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder