Abstract
We introduce an interactive visualization system, AViz, which discovers 3D numerical association rules from large data sets. The process of discovering association rules is visualized, which consists of six steps: preparing the raw data set, visualizing the original data set, cleaning the data, discretizing numerical attributes, and mining and visualizing the discovered association rules. The architecture of the AViz system is presented and each step is discussed. To discretize numerical attributes, three approaches, including equal-sized, bin-packing based equal-depth, and interaction-based approaches, are implemented and compared. The algorithm for mining and visualizing numerical association rules is proposed. Our experimental result on a census data set shows that the AViz system is useful and helpful for discovering and visualizing numerical association rules.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A. (1993) Mining association rules between sets of items in large databases, Proc. of the ACM SIGMOD International Conference on Management of Data, 207 - 216.
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A. I. (1996) Fast Discovery of Association Rules, in Advances in Knowledge Discovery and Data Mining ed. by U. M. Fayyard, G. Piatetsky-Shapiro, P. Smyth, and R. Uthrusamy, 307 - 328, AAAI Press, Menlo Park, CA.
Agrawal, R., Srikant, R. (1994) Fast algorithm for mining association rules in large databases, Proc. of the 20th International Conference on VLDB, 487 - 499.
Agrawal, R., Shafer, J. C. (1996) Parallel mining of association rules, IEEE Transactions on Knowledge and Data Engineering, 8 (6), 962 - 969.
Brin, S., Motwani, R., Silverstein, C. (1997) Beyond Market Baskets: Generalizing Association Rules to Correlations, Proc. of the ACM SIGMOD International Conference on Management of Data, 265 - 276.
Chan, K. C. C., Au, W. (1997) Mining Fuzzy Association Rules, Proc. of the 6th Internal. Conf. on Info. and Knowledge Management, CIKM’97, 209 – 215.
Cai, Y., Cercone, N., Han, J. (1991) Attribute Oriented Induction in Relational Databases, in Knowledge Discovery in Databases ed. by Gregory PiatetskyShapiro and William J. Frawley, 213-228.
Cercone, N., Hamilton, H. (1998) Database Mining, Encyclopedia of Electrical and Electronics Engineering 4, 576 - 604.
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T. (1996) Mining Optimized Association Rules for Numeric Attributes, Proc. of the 15th ACM Symposium on Principles of Database System, 182 - 191.
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T. (1996) Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization, Proc. of the ACM SIGMOD International Conference on Management of Data, 13 - 24.
Han, J., Cercone, N. (1999) DVIZ: A System for Visualizing Data Mining, Lecture Notes in Artificial Intelligence 1574, Proc. of the 3rd Pacific-Asia Knowledge Discovery in Databases, pp. 390 - 399.
Han, J., Fu, Y. (1995) Discovery of multiple-level association rules, Proc. of the 21th International Conference on VLDB, 420 - 431.
Houtsma, M., Swami, A. (1995) Set-oriented mining of association rules, Proc. of the International Conference on Data Engineering, 25 - 34.
Hu, X., Cercone, N. (1999) Data Mining via Discretization, Generalization and Rough Set Feature Selection, Knowledge and Information System: An International Journal, 1 (1), 33 - 60.
Keim, D. A., Kriegel, H. P. (1996) Visualization Techniques for Mining Large Databases: A Comparison, Transaction on Knowledge and Data Engineering, 8 (6), 923 - 938.
Kennedy, J. B., Mitchell, K. J., Barchay, P. J. (1996) A framework for information visualization, SIGMORD Record, 25 (4), 30 - 34.
Mannila, H., Toivonen, H., Verkamo, A. I. (1994) Efficient algorithms for discovering association rules, Proc. of the AAAI Workshop on Knowledge Discovery in Databases, 144 - 155.
Miller, R. J., Yang, Y. (1997) Association Rules over Interval Data, Proc. of the ACM SIGMOD International Conference on Management of Data, 452 - 461.
Park, J. S., Chen, M. S., Yu, P. S. (1995) An effective hash based algorithm for mining association rules, Proc. of the ACM SIGMOD International Conference on Management of Data, 175 - 186.
Piatetsky-Shapiro, G. (1991) Discovery, Analysis, and Presentation of Strong Rules, in Knowledge Discovery in Databases ed. by Gregory Piatetsky-Shapiro and William J. Frawley, 229-260.
Quinlan, J. R. (1993) C4. 5: Programs for Machine Learning, CA: Morgan Kaufmann.
Savasere, A., Omiecinski, E., Navathe, S. (1995) An efficient algorithm for mining association rules in large databases, Proc. of the 21th International Conference on VLDB, 432 - 444.
Srikant, R., Agrawal, R. (1996) Mining Quantitative Association Rules in Large Relational Tables, Proc. of the ACM SIGMOD International Conference on Management of Data, 1 - 12.
Srikant, R., Agrawal, R. (1995) Mining generalized association rules, Proc. of the 21st International Conference on VLDB, 407 - 419.
Toivonen, H. (1996) Sampling large databases for finding association rules, Proc. of the 22nd International Conference on VLDB, 134 - 145.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Han, J., Cercone, N., Hu, X. (2002). An Interactive Visualization System for Mining Association Rules. In: Lin, T.Y., Yao, Y.Y., Zadeh, L.A. (eds) Data Mining, Rough Sets and Granular Computing. Studies in Fuzziness and Soft Computing, vol 95. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1791-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1791-1_7
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-2508-4
Online ISBN: 978-3-7908-1791-1
eBook Packages: Springer Book Archive