Skip to main content
Top

2014 | OriginalPaper | Chapter

13. Frequent Item Sets and Association Rules

Authors : Dan A. Simovici, Chabane Djeraba

Published in: Mathematical Tools for Data Mining

Publisher: Springer London

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference P.N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining (Addison-Wesley, Reading, 2005) P.N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining (Addison-Wesley, Reading, 2005)
2.
go back to reference 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 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
3.
go back to reference C.C. Aggarwal, P.S. Yu, Mining associations with the collective strength approach. IEEE Trans. Knowl. Data Eng. 13, 863–873 (2001)CrossRef C.C. Aggarwal, P.S. Yu, Mining associations with the collective strength approach. IEEE Trans. Knowl. Data Eng. 13, 863–873 (2001)CrossRef
4.
go back to reference 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 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
5.
go back to reference 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. 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
6.
go back to reference 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 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
7.
go back to reference R. Hilderman, H. Hamilton. Knowledge discovery and interestingness measures: a survey. Technical Report CS 99–04, Department of Computer Science, University of Regina, 1999 R. Hilderman, H. Hamilton. Knowledge discovery and interestingness measures: a survey. Technical Report CS 99–04, Department of Computer Science, University of Regina, 1999
8.
go back to reference H. Mannila, H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Technical Report C-1997-8, University of Helsinki, 1997 H. Mannila, H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Technical Report C-1997-8, University of Helsinki, 1997
9.
go back to reference 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 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
10.
go back to reference 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)CrossRef 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)CrossRef
11.
go back to reference 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) 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)
12.
go back to reference J.-M. Adamo, Data Mining for Association Rules and Sequential Patterns (Springer-Verlag, New York, 2001)CrossRefMATH J.-M. Adamo, Data Mining for Association Rules and Sequential Patterns (Springer-Verlag, New York, 2001)CrossRefMATH
13.
go back to reference 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 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
14.
go back to reference 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 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
15.
go back to reference 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, 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
16.
go back to reference 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)CrossRefMATH 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)CrossRefMATH
Metadata
Title
Frequent Item Sets and Association Rules
Authors
Dan A. Simovici
Chabane Djeraba
Copyright Year
2014
Publisher
Springer London
DOI
https://doi.org/10.1007/978-1-4471-6407-4_13

Premium Partner