Pincer-search: A new algorithm for discovering the maximum frequent set
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 103-119
- https://doi.org/10.1007/bfb0100980
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Pincer-search: A new algorithm for discovering the maximum frequent setPublished by Springer Nature ,1998
- Dynamic itemset counting and implication rules for market basket dataPublished by Association for Computing Machinery (ACM) ,1997
- Parallel Algorithms for Discovery of Association RulesPublished by Springer Nature ,1997
- Discovering all most specific sentences by randomized algorithms extended abstractPublished by Springer Nature ,1997
- 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
- Generalization as searchArtificial Intelligence, 1982