Abstract
Association rules are one of the most used tools to discover relationships among attributes in a database. Nowadays, there are many efficient techniques to obtain these rules, although most of them require that the values of the attributes be discrete. To solve this problem, these techniques discretize the numeric attributes, but this implies a loss of information. In a general way, these techniques work in two phases: in the first one they try to find the sets of attributes that are, with a determined frequency, within the database (frequent itemsets), and in the second one, they extract the association rules departing from these sets. In this paper we present a technique to find the frequent itemsets in numeric databases without needing to discretize the attributes. We use an evolutionary algorithm to find the intervals of each attribute that conforms a frequent itemset. The evaluation function itself will be the one that decide the amplitude of these intervals. Finally, we evaluate the tool with synthetic and real databases to check the efficiency of our algorithm.
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.: Mining association rules between sets of items in large databases. Proc. ACM SIGMOD. (1993) 207–216, Washington, D.C.
Agrawal, R., Srikant, R: Fast Algorithms for Mining Association Rules. Proc. of the VLDB Conference (1994) 487–489, Santiago (Chile)
Aumann, Y., Lindell, Y.: A Statistical Theory for Quantitative Association Rules. Proceedings KDD99 (1999) 261–270, San Diego, CA
Goldberg, D.E: Genetic algorithms in search, optimization and machine learning. Addison-Wesley. (1989)
González, A., Herrera, F.: Multi-stage Genetic Fuzzy System Based on the Iterative Rule Learning Approach. Mathware & Soft Computing, 4 (1997)
Guvenir, H. A., Uysal, I.: Bilkent University Function Approximation Repository, http://funapp.cs.bilkent.edu.tr (2000)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. Proc. of the ACM SIGMOD Int’l Conf. on Management of Data (2000)
Lin, D-I., Kedem, Z.M.: Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set. In Proc. of the 6th Int’l Conference on Extending Database Technology (EDBT) (1998) 105–119 Valencia
Manila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. KDD-94: AAAI Workshop on Knowledge Discovery in Databases (1994) 181–192 Seatle, Washington
Mata, J., Alvarez, J.L., Riquelme, J.C.: Mining Numeric Association Rules with Genetic Algorithms. 5th Internacional Conference on Artificial Neural Networks and Genetic Algorithms, ICANNGA (2001) 264–267 Praga
Miller, R. J., Yang, Y.: Association Rules over Interval Data. Proceedings of the International ACM SIGMOD Conference (1997) Tucson, Arizona
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules
Park, J. S., Chen, M. S., Yu. P.S.: An Effective Hash Based Algorithm for Mining Association Rules. Proc. of the ACM SIGMOD Int’l Conf. on Management of Data (1995) San José, CA
Savarese, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. Proc. of the VLDB Conference, Zurich, Switzerland (1995)
Srikant, R, Agrawal, R.: Mining Quantitative Association Rules in Large Relational Tables. Proc. of the ACM SIGMOD (1996) 1–12
Wang, K., Tay. S.H., Liu, B.: Interestingness-Based Interval Merger for Numeric Association Rules. Proc. 4th Int. Conf. KDD (1998) 121–128
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mata, J., Alvarez, JL., Riquelme, JC. (2002). Discovering Numeric Association Rules via Evolutionary Algorithm. In: Chen, MS., Yu, P.S., Liu, B. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2002. Lecture Notes in Computer Science(), vol 2336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47887-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-47887-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43704-8
Online ISBN: 978-3-540-47887-4
eBook Packages: Springer Book Archive