Abstract
We analyze several problems of optimizing disjunctive association rules. The problems have important applications in data mining, allowing users to focus at interesting rules extracted from databases. We consider association rules of the form \(\bigwedge_{j=1}^{n}(A_{i_j}=v_j)\rightarrow C_2\), where \(\{A_{i_1},A_{i_2},\ldots,A_{i_n}\}\) is a subset of the categorical attributes of the underlying relation R, and C 2 is any fixed condition defined over the attributes of the relation R. An instantiation of the rule binds the variables v j ’s to values from the corresponding attribute domains. We study several problems, in which we seek a collection of instantiations of a given rule that satisfy certain optimality constraints. Each of the problems can re-interpreted as looking for one optimized disjunctive association rule. We exhibit efficient algorithms for solving the optimized support and optimized confidence problems, the weighted support/confidence problem, and the shortest rule problem. We discuss time and splace complexity of the designed algorithms and show how they can be improved by allowing for approximate solutions.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. SIGMOD 22(2) (1993)
Danzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): An-vances in Knowledge Discovery and Data Mining. AAAI Press / The MIT Press (1996)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Mining optimized association rules for numeric attributes. In: PODS (1996)
Godfrey, P.: Minimization in cooperative response to failing database queries. Technical Report CS-TR-3348, University of Maryland, College Park (1994)
Gunopoulos, D., Mannila, H., Saluja, S.: Discovering all most specific sentences by randomized algorithms. In: ICDT (1997)
Gunopulos, D., Mannila, H., Khardon, R., Toivonen, H.: Data mining, hypergraph transversals, and machine learning (extended abstract). In: PODS (1997)
Han, J., Fu, Y.: Discovery of multiple-level association rules from large databases. In: VLDB (1995)
Hochbaum, D.S. (ed.): Approximation Algorithms for NP-hard problems. PWS Publishing Company (1997)
Lawler, E.: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research 4 (1979)
Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: KDD (1994)
Rastogi, R., Shim, K.: Mining optimized association rules for categorical and numeric attributes. In: ICDE (1998)
Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: ICMD (1996)
Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: VLDB (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zelenko, D. (1999). Optimizing Disjunctive Association Rules. In: Żytkow, J.M., Rauch, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1999. Lecture Notes in Computer Science(), vol 1704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48247-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-48247-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66490-1
Online ISBN: 978-3-540-48247-5
eBook Packages: Springer Book Archive