Abstract
Association rules have been popular in theory, though it is unclear how much success they have had in practice. Very many association rules are found in any application by any approach and they require effective pruning and filtering. There has been much research in this area recently, but less with the goal of providing a global overview and summary of all rules, which may then be used to explore the rules and to evaluate their worth. The unusual feature of association rules is that those with the highest objective values for the two key criteria (support and confidence) are not usually those with the most subjective interest (because we know the obvious results already). The TwoKey plot is a way of displaying all discovered association rules at once, while also providing the means to review and manage them. It is a powerful tool in order to get a first overview of the distribution of confidence and support. Features such as separate groups of rules or outliers are detected immediately. By exploiting various ancestor relationship structures among the rules, we can use the TwoKey Plot also as a visual assessment tool, closely related to pruning methods — e.g. those proposed by Bing Liu (1999). The concept will be illustrated using the interactive software MARC(Multiple Association Rules Control).
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. (1993) Mining Associations between Sets of Items in Massive Databases. Proc. of the ACM-SIGMOD 1993 Int’l Conference on Management of Data, Washington D.C., pp. 207–216.
Becker R.A., Cleveland W.S. & Wilks A. (1987) Dynamic Graphics For Data Analysis. In: Cleveland & McGill, 1988, pp.1–50.
Bing Liu, Wynne Hsu & Yiming Ma (1999) Pruning and Summarizing the Discovered Association Rules. In Proc. of the 5th ACM SIGKDD Conference: KDD99, pp.125–134, 1999.
Buckland, S.T., Bell, M.V. and Picozzi, N. (eds) (1990) The Birds of North-East Scotland. North-East Scotland Bird Club, Aberdeen. 473pp.
Bruzzese, D., Davino, C. (2001) Statistical Pruning of Discovered Association Rules. Computational Statistics (to be published)
Cleveland W. & McGill R. (1988) Dynamic Graphics for Statistics. Pacific Grove, CA: Wadsworth & Brooks, Inc.
Hofmann H. (2000) Exploring categorical data: interactive mosaic plots. Metrika, 51(1), 11–26.
Hofmann H. (2000) MANET http://www1.math.uni-augsburg.de/Manet/. In Augsburg: Rosuda.
Hofmann H., Siebes A., Wilhelm A. (2000) Visualizing Association Rules with Interactive Mosaic Plots, In Proc. of the 6th Int’l Conference of SigKDD, pp. 227–235.
Hofmann, H., Wilhelm, A. (2001) Visual Comparison of Association Rules. Computational Statistics (to be published)
Mannila, H (1997) Methods and Problems in Data Mining. In F. Afrati Kolaitis, P. (Ed.), International Conference on Database Theory,. Delphi: Springer.
Piatetsky-Shapiro, G. & Masand, B. (1999) Estimating Campaign Benefits and Modeling Lift. In 5th ACM SIGKDD, (pp. 185–193).
Theus M. (1996) Theorie und Anwendung Interaktiver Statistischer Graphik. Augsburger mathematisch-naturwissenschaftliche Schriften, 14, Wißner Verlag, Ausgburg, Germany.
Unwin, A. R. (1999) Requirements for interactive graphics software for exploratory data analysis. Computational Statistics, 14, 7–22.
Unwin A. R., Hawkins G. Hofmann H. & Siegl B. (1996) Interactive Graphics for Data Sets with Missing Values-MANET. Journal of Computational and Graphical Statistics, 5, 2, pp. 113–122.
Wilhelm A. (2000) Interactive Statistical Graphics: The Paradigm of Linked Views. Habilitationsschrift, Universitat Augsburg.
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
Unwin, A., Hofmann, H., Bernt, K. (2001). The TwoKey Plot for Multiple Association Rules Control. In: De Raedt, L., Siebes, A. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2001. Lecture Notes in Computer Science(), vol 2168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44794-6_39
Download citation
DOI: https://doi.org/10.1007/3-540-44794-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42534-2
Online ISBN: 978-3-540-44794-8
eBook Packages: Springer Book Archive