Abstract
Frequent association rules (e.g., A∧B⇒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⇒⌝C or ⌝A∧B⇒C. Mining such rules is difficult and remains an open problem. We identify several possibilities for a tractable approach in practical cases. Among others, we discuss the active use of constraints. We propose a generic algorithm and discuss the use of constraints to mine the generalized sets from which rules with negations can be derived.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules Between Sets of Items in Large Databases. In Proc. ACM SIGMOD’93, 207–216, 1993.
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining, 307–328. AAAI Press, 1996.
J.-F. Boulicaut and A. Bykowski. Frequent Closures as a Concise Representation for Binary Data Mining. In Proc. PAKDD’00, LNAI 1805,62–73, Kyoto, JP, 2000. Springer.
J.-F. Boulicaut and B. Jeudy. Using Constraints During Set Mining: Should We Prune or not? In Proc. BDA’00,Blois, F, 2000. INRIA. to appear.
J.-F. Boulicaut, M. Klemettinen, and H. Mannila. Querying Inductive Databases: A Case Study on the MINE RULE Operator. In Proc. PKDD’98, LNAI 1510, 194–202, Nantes, F, 1998. Springer.
L. Dehaspe and L. D. Raedt. Mining Association Rules in Multiple Relations. In Proc. ILP’97, LNAI 1297, 125–132. 1997. Springer.
F. Giannotti and G. Manco. Querying Inductive Databases via Logic-Based User Defined Aggregates. In Proc. PKDD’99, LNAI 1704,125–135, Praha, CZ, 1999. Springer.
S. Guillaume, F. Guillet, and J. Philippé. Improving the Discovery of Association Rules with Intensity of Implication (short paper). In Proc. PKDD’98, LNAI 1510, 318–327, Nantes, F, 1998. Springer.
J. Han and Y. Fu. Discovery of Multiple-Level Association Rules from Large Databases. In Proc. VLDB’95, 420–431, Zürich, CH, 1995.
T. Imielinski and H. Mannila. A Database Perspective on Knowledge Discovery. Communications of the ACM, 39 (11): 58–64, Nov. 1996.
M. Klemettinen. Rule Discovery from Telecommunication Network Alarm Databases. PhD thesis, Dept. of Comp. Sc., Univ. of Helsinki, Jan. 1999.
H. Mannila and H. Toivonen. Multiple Uses of Frequent Sets and Condensed Representations. In Proc. KDD’96, 189–194, Portland, USA, 1996.
H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1 (3): 241–258, 1997.
R. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory Mining and Pruning Optimization of Constrained Association Rules. In Proc. ACM SIGMOD’98, 13–24, Seattle, USA, 1998.
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems, 24 (1): 25–46, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boulicaut, JF., Bykowski, A., Jeudy, B. (2001). Towards the Tractable Discovery of Association Rules with Negations. In: Larsen, H.L., Andreasen, T., Christiansen, H., Kacprzyk, J., Zadrożny, S. (eds) Flexible Query Answering Systems. Advances in Soft Computing, vol 7. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1834-5_39
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1834-5_39
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1347-0
Online ISBN: 978-3-7908-1834-5
eBook Packages: Springer Book Archive