Towards the Tractable Discovery of Association Rules with Negations
- 1 January 2001
- book chapter
- Published by Springer Nature
- p. 425-434
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Frequent Closures as a Concise Representation for Binary Data Mining2000
- Efficient mining of association rules using closed itemset latticesInformation Systems, 1999
- Querying Inductive Databases via Logic-Based User-Defined Aggregates1999
- Improving the discovery of association rules with intensity of implication1998
- Querying inductive databases: A case study on the MINE RULE operator1998
- Levelwise Search and Borders of Theories in Knowledge DiscoveryData Mining and Knowledge Discovery, 1997
- Mining association rules in multiple relations1997
- A database perspective on knowledge discoveryCommunications of the ACM, 1996