Abstract
In this paper we propose an approach for mining association rules in large, dense databases. For finding such rules, frequent itemsets must first be discovered. As finding all the frequent itemsets is very time-consuming for dense databases, we propose an algorithm that is able to quickly discover an image of the complete set containing all the frequent itemsets. We define what an image is, and we present a genetic algorithm for discovering such an image. To monitor the discovery process we introduce the notion of dynamics of the algorithm. To measure the performances of our frequent itemsets discovery algorithm, we introduce the notion of efficiency of the discovery process.
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 Items in Large Databases. Proc. of the 1993 ACM-SIGMOD Int’l Conf. on Management of Data, Washington, D.C., 1993
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. Proc. of the 20th VLDB Conference, Santiago, Chile, 1994
Aggarwal, C., Yu, P.: Online Generation of Association Rules. Proc. of 14th Int’l Conf. on Data Engineering, 1998
Bayardo, R.J., Agrawal, R., Gunopulos, D.: Constraint Rules Mining in Large, Dense Databases. Proc. of 15th Conf. on Data Engineering, 1999
Bayardo, R.J., Agrawal R.: Mining the Most Interesting Rules. Proc. of the 5th ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, 1999
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, Adisson-Wesley Pub. Co., 1989
Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. KDD-99 San Diego CA USA, 1999
Park, J.S., Chen, M-S, Yu, P.S.: An Effective Hash-Based Algorithm for Mining Association Rules. SIGMOD, 1995
Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. Proc. of the 21st VLDB Conference, Zurich, Switzerland, 1995
Tudor, J., Nachouki G., A genetic algorithm for discovering frequent itemsets in large, dense databases, research report of Nantes University (IRIN) n° 00.9, 2000
Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: Parallel Algorithms for Discovery of Association Rules. Data Mining and Knowledge Discovery 1–4, Kluwer 1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Teusan, T., Nachouki, G., Briand, H., Philippe, J. (2000). Discovering Association Rules in Large, Dense Databases. In: Zighed, D.A., Komorowski, J., Żytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2000. Lecture Notes in Computer Science(), vol 1910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45372-5_78
Download citation
DOI: https://doi.org/10.1007/3-540-45372-5_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41066-9
Online ISBN: 978-3-540-45372-7
eBook Packages: Springer Book Archive