Exploratory mining and pruning optimizations of constrained associations rules
- 1 June 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 27 (2), 13-24
- https://doi.org/10.1145/276304.276307
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Query flocksACM SIGMOD Record, 1998
- Database systems—breaking out of the boxACM SIGMOD Record, 1997
- Scalable parallel data mining for association rulesPublished by Association for Computing Machinery (ACM) ,1997
- Online aggregationPublished by Association for Computing Machinery (ACM) ,1997
- A database perspective on knowledge discoveryCommunications of the ACM, 1996
- Data mining using two-dimensional optimized association rulesPublished by Association for Computing Machinery (ACM) ,1996
- Mining quantitative association rules in large relational tablesPublished by Association for Computing Machinery (ACM) ,1996
- Parallel mining of association rulesIEEE Transactions on Knowledge and Data Engineering, 1996
- An effective hash-based algorithm for mining association rulesPublished by Association for Computing Machinery (ACM) ,1995
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993