Abstract
Association rules have received lots of attention in data mining due to their many applications in marketing, advertising, inventory control, and many other areas.
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
References
P.N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining (Addison-Wesley, Reading, 2005)
G. Piatetsky-Shapiro, in Knowledge Discovery in Databases, ed. by G. Piatetsky-Shapiro, W. Frawley. Discovery, analysis and presentation of strong rules, (MIT Press, Cambridge, MA, 1991), pp. 229–248
C.C. Aggarwal, P.S. Yu, Mining associations with the collective strength approach. IEEE Trans. Knowl. Data Eng. 13, 863–873 (2001)
R. Bayardo, R. Agrawal, in Proceedings of the 5th KDD, ed. by S. Chaudhuri, D. Madigan. Mining the most interesting rules, San Diego, CA, (ACM, New York, 1999), pp. 145–153
S. Brin, R. Motwani, C. Silverstein, in Proceedings of the ACM SIGMOD International Conference on Management of Data, ed. by J. Pekham. Beyond Market Baskets: Generalizing Association Rules to Correlations. Tucson, AZ, (ACM, New York, 1997), pp. 265–276
S. Jaroszewicz, D. Simovici, in Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, eds. by ed. by W. Kim, R. Kohavi, J. Gehrke, W. DuMouchel. Interestingness of Frequent Item Sets Using Bayesian Networks as Background Knowledge, Seattle, WA, (ACM, New York, 2004), pp. 178–186
R. Hilderman, H. Hamilton. Knowledge discovery and interestingness measures: a survey. Technical Report CS 99–04, Department of Computer Science, University of Regina, 1999
H. Mannila, H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Technical Report C-1997-8, University of Helsinki, 1997
N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, in Database Theory - ICDT’99, ed. by C. Beeri, P. Buneman. Lecture Notes in Computer Science. Discovering frequent closed itemsets for association rules, vol. 1540, Jerusalem, Israel, (Springer-Verlag, Berlin, 1999), pp. 398–416
M.J. Zaki, C.J. Hsiao, Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. 17, 462–478 (2005)
M. Steinbach, G. Karypis, V. Kumar, in A Comparison of Document Clustering Techniques, eds. by M. Grobelnik, D. Mladenic, N. Milic-Freyling. (KDD Workshop on Text Mining, Boston 2000)
J.-M. Adamo, Data Mining for Association Rules and Sequential Patterns (Springer-Verlag, New York, 2001)
R. Agrawal, T. Imielinski, A.N. Swami, in Proceedings of the 1993 International Conference on Management of Data, eds. by P. Buneman, S. Jajodia. Mining association rules between sets of items in large databases. Washington, D.C., (ACM, New York, 1993), pp. 207–216
J. Han, J. Pei, Y. Yin, in Proceedings of the ACM-SIGMOD International Conference on Management of Data, eds. by W. Chen, J.F. Naughton, P.A. Bernstein. Mining Frequent Patterns Without Candidate Generation, Dallas, TX, (ACM, New York, 2000), pp. 1–12
R.C. Agarwal, C.C. Aggarwal, V. V. V. Prasad, in Proceedings of the 6th Conference on Knowledge Discovery in Data, ed. by R. Bayardo, R. Ramakrishnan, S.J. Stolfo. Depth First Generation of Long Patterns, Boston, MA, (ACM, New York, 2000), pp. 108–118
R.C. Agarwal, C.C. Aggarwal, V.V.V. Prasad, A tree projection algorithm for generation of frequent item sets. J. Parallel Distrib. Comput. 61(3), 350–371 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Simovici, D.A., Djeraba, C. (2014). Frequent Item Sets and Association Rules. In: Mathematical Tools for Data Mining. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-4471-6407-4_13
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6407-4_13
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6406-7
Online ISBN: 978-1-4471-6407-4
eBook Packages: Computer ScienceComputer Science (R0)