SIGN IN
SIGN UP
Mining optimal decision trees from itemset lattices
Full Text:
PDF
Buy this Article
Authors:
Siegfried Nijssen
K. U. Leuven
Elisa Fromont
K. U. Leuven
Published in:
· Proceeding
KDD '07
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Pages 530-539
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-609-7
doi>
10.1145/1281192.1281250
2007 Article
Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 80
· Downloads (cumulative): 1,135
· Citation Count: 9
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
KDD 13
Share:
|
Tags:
algorithms
constraint-based mining
data mining
decision trees
dynamic programming
experimentation
formal concepts
frequent itemsets
performance
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