Scalable data mining with model constraints
- 1 December 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGKDD Explorations Newsletter
- Vol. 2 (2) , 39-48
- https://doi.org/10.1145/380995.381012
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient algorithms for constructing decision trees with constraintsPublished by Association for Computing Machinery (ACM) ,2000
- BOAT—optimistic decision tree constructionPublished by Association for Computing Machinery (ACM) ,1999
- CUREPublished by Association for Computing Machinery (ACM) ,1998
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- An overview of query optimization in relational systemsPublished by Association for Computing Machinery (ACM) ,1998
- Efficient data mining for path traversal patternsIEEE Transactions on Knowledge and Data Engineering, 1998
- An efficient algorithm for optimal pruning of decision treesArtificial Intelligence, 1996
- Trading Accuracy for Simplicity in Decision TreesMachine Learning, 1994
- Inferring decision trees using the minimum description lenght principleInformation and Computation, 1989
- Access path selection in a relational database management systemPublished by Association for Computing Machinery (ACM) ,1979