Abstract
Mining quantitative association rules is an important topic of data mining since most real world databases have both numerical and categorical attributes. Typical solutions involve partitioning each numerical attribute into a set of disjoint intervals, interpreting each interval as an item, and applying standard boolean association rule mining. Commonly used partitioning methods construct set of intervals that either have equal width or equal cardinality. We introduce an adaptive partitioning method based on repeatedly merging smaller intervals into larger ones. This method provides an effective compromise between the equal width and equal cardinality criteria. Experimental results show that the proposed method is an effective method and improves on both equal-width partitioning and equal-cardinality partitioning.
This is a preview of subscription content, log in via an institution to check access.
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.: Fast algorithms for mining association rules in large databases. In: 20th Int’l Conf. on Very Large Databases (VLDA) (June 1994)
Catlett, J.: On changing continuous attributes into ordered discrete attributes. In: Kodratoff, Y. (ed.) EWSL 1991. LNCS (LNAI), vol. 482, pp. 164–178. Springer, Heidelberg (1991)
Cerquides, J., de MÃ ntaras, R.L.: Proposal and empirical comparison of a parallelizable distance-based discretization method. In: Heckerman, D., Mannila, H., Pregibon, D., Uthurusamy, R. (eds.) Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-1997), p. 139. AAAI Press, Menlo Park (1997)
Van de Merckt, T.: Decision trees in numerical attributes spaces. In: IJCAI-1993 (1993)
Dougherty, J., Kohavi, R., Sahami, M.: Supervised and unsupervised discretization of continuous features. In: Proc. 12th International Conference on Machine Learning, pp. 194–202. Morgan Kaufmann, San Francisco (1995)
Fayyad, U.M., Irani, K.B.: Multi-interval discretization of continuousvalued attributes for classification learning. In: IJCAI-1993 (1993)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Mining optimized association rules for numeric attributes. In: Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 1996, vol. 15, pp. 182–191. ACM, New York (1996)
Kohavi, R., Sahami, M.: Error-based and entropy-based discretization of continuous features. In: Simoudis, E., Han, J.W., Fayyad, U. (eds.) Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, pp. 114–119. AAAI Press, Menlo Park
Lent, B., Swami, A., Widom, J.: Clustering association rules. In: Proceedings of the 13th International Conference on Data Engineering (ICDE 1997), Washington - Brussels - Tokyo, pp. 220–231. IEEE, Los Alamitos (1997)
Leonard, K., Peter, R.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley-Interscience Publication, Hoboken (1990)
Miller, R.J., Yang, Y.: Association rules over interval data. SIGMOD Record (ACM Special Interest Group on Management of Data) 26(2), 452–461 (1997)
Shen, J.L.H., Pritchard, P.: Knowledge network based association discovery. In: Proc. of 1999 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 1999) (1999)
Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. SIGMOD Record (ACM Special Interest Group on Management of Data)Â 25(2) (1996)
Wang, K., Tay, S.H.W., Liu, B.: Interestingness-based interval merger for numeric association rules. In: Agrawal, R., Stolorz, P.E., Piatetsky-Shapiro, G. (eds.) Proc. 4th Int. Conf. Knowledge Discovery and Data Mining, KDD, pp. 121–128. AAAI Press, Menlo Park (1998)
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
Li, J., Shen, H., Topor, R. (1999). An Adaptive Method of Numerical Attribute Merging for Quantitative Association Rule Mining. In: Hui, L.C.K., Lee, DL. (eds) Internet Applications. ICSC 1999. Lecture Notes in Computer Science, vol 1749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46652-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-46652-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66903-6
Online ISBN: 978-3-540-46652-9
eBook Packages: Springer Book Archive