Towards the Tractable Discovery of Association Rules with Negations

Frequent association rules (e.g., AB C to say that when properties A and B are true in a record then, C tends to be also true) have become a popular way to summarize huge datasets. The last 5 years, there has been a lot of research on association rule mining and more precisely, the tractable discovery of interesting rules among the frequent ones. We consider now the problem of mining association rules that may involve negations e.g., A B

• Type: Conference
• Year: 2000
• Where: FQAS
• Authors: Jean-François Boulicaut, Artur Bykowski, Baptiste Jeudy
• Keywords: Association Rule Mining, Association Rules, Database, FQAS 2000, Frequent Association Rules