Skip to main content

2015 | OriginalPaper | Buchkapitel

A New Evolutionary Algorithm for Extracting a Reduced Set of Interesting Association Rules

verfasst von : Mir Md. Jahangir Kabir, Shuxiang Xu, Byeong Ho Kang, Zongyuan Zhao

Erschienen in: Neural Information Processing

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Data mining techniques involve extracting useful, novel and interesting patterns from large data sets. Traditional association rule mining algorithms generate a huge number of unnecessary rules because of using support and confidence values as a constraint for measuring the quality of generated rules. Recently, several studies defined the process of extracting association rules as a multi-objective problem allowing researchers to optimize different measures that can present in different degrees depending on the data sets used. Applying evolutionary algorithms to noisy data of a large data set, is especially useful for automatic data processing and discovering meaningful and significant association rules. From the beginning of the last decade, multi-objective evolutionary algorithms are gradually becoming more and more useful in data mining research areas. In this paper, we propose a new multi-objective evolutionary algorithm, MBAREA, for mining useful Boolean association rules with low computational cost. To accomplish this our proposed method extends a recent multi-objective evolutionary algorithm based on a decomposition technique to perform evolutionary learning of a fitness value of each rule, while introducing a best population and a class based mutation method to store all the best rules obtained at some point of intermediate generation of a population and improving the diversity of the obtained rules. Moreover, this approach maximizes two objectives such as performance and interestingness for getting rules which are useful, easy to understand and interesting. This proposed algorithm is applied to different real world data sets to demonstrate the effectiveness of the proposed approach and the result is compared with existing evolutionary algorithm based approaches.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Literatur
1.
Zurück zum Zitat Van Renesse, R., Birman, K.P., Vogels, W.: Astrolabe: a robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst. 21(2), 164–206 (2003)CrossRef Van Renesse, R., Birman, K.P., Vogels, W.: Astrolabe: a robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst. 21(2), 164–206 (2003)CrossRef
2.
Zurück zum Zitat Maulik, U., Bandyopadhyay, S., Mukhopadhyay, A.: Multiobjective Genetic Algorithms for Clustering: Applications in Data Mining and Bioinformatics. Springer, Berlin (2011)CrossRefMATH Maulik, U., Bandyopadhyay, S., Mukhopadhyay, A.: Multiobjective Genetic Algorithms for Clustering: Applications in Data Mining and Bioinformatics. Springer, Berlin (2011)CrossRefMATH
3.
Zurück zum Zitat Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann, Burlington (2006)MATH Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann, Burlington (2006)MATH
4.
Zurück zum Zitat Aggarwal, C.C., Yu, P.S.: A new framework for itemset generation. In: PODS Conference, pp. 18–24 (1998) Aggarwal, C.C., Yu, P.S.: A new framework for itemset generation. In: PODS Conference, pp. 18–24 (1998)
5.
Zurück zum Zitat Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD 29(2), 1–12 (2000)CrossRef Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD 29(2), 1–12 (2000)CrossRef
6.
Zurück zum Zitat Yan, X., Zhang, C., Zhang, S.: Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support. Expert Syst. Appl. 36(2), 3066–3076 (2009)CrossRef Yan, X., Zhang, C., Zhang, S.: Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support. Expert Syst. Appl. 36(2), 3066–3076 (2009)CrossRef
7.
8.
Zurück zum Zitat Qodmanan, H.R., Nasiri, M., Minaei-Bidgoli, B.: Multi objective association rule mining with genetic algorithm without specifying minimum support and minimum confidence. Expert Syst. Appl. 38(1), 288–298 (2011)CrossRef Qodmanan, H.R., Nasiri, M., Minaei-Bidgoli, B.: Multi objective association rule mining with genetic algorithm without specifying minimum support and minimum confidence. Expert Syst. Appl. 38(1), 288–298 (2011)CrossRef
9.
Zurück zum Zitat Kannimuthu, S., Premalatha, K.: Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl. Artif. Intell. 28(4), 337–359 (2014)CrossRef Kannimuthu, S., Premalatha, K.: Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl. Artif. Intell. 28(4), 337–359 (2014)CrossRef
10.
Zurück zum Zitat Yan, X., Zhang, C., Zhang, S.: ARMGA: identifying interesting association rules with genetic algorithms. Appl. Artif. Intell. Int. J. 19(7), 677–689 (2005)CrossRef Yan, X., Zhang, C., Zhang, S.: ARMGA: identifying interesting association rules with genetic algorithms. Appl. Artif. Intell. Int. J. 19(7), 677–689 (2005)CrossRef
11.
Zurück zum Zitat Martin, D., Rosete, A., Alcala-Fdez, J., Herrera, F.: A new multiobjective evolutionary algorithm for mining a reduced set of interesting positive and negative quantitative association rules. IEEE Trans. Evol. Comput. 18(1), 54–69 (2014)CrossRef Martin, D., Rosete, A., Alcala-Fdez, J., Herrera, F.: A new multiobjective evolutionary algorithm for mining a reduced set of interesting positive and negative quantitative association rules. IEEE Trans. Evol. Comput. 18(1), 54–69 (2014)CrossRef
12.
Zurück zum Zitat Ampan, A.C.: A programming interface for medical diagnosis prediction. Artif. Intell. LI(1), 21–30 (2006) Ampan, A.C.: A programming interface for medical diagnosis prediction. Artif. Intell. LI(1), 21–30 (2006)
13.
Zurück zum Zitat del Jesus, M.J., Gámez, J.A., González, P., Puerta, J.M.: On the discovery of association rules by means of evolutionary algorithms. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 1(5), 397–415 (2011)CrossRef del Jesus, M.J., Gámez, J.A., González, P., Puerta, J.M.: On the discovery of association rules by means of evolutionary algorithms. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 1(5), 397–415 (2011)CrossRef
14.
Zurück zum Zitat Zhou, L., Yau, S.: Efficient association rule mining among both frequent and infrequent items. Comput. Math Appl. 54(6), 737–749 (2007)MathSciNetCrossRefMATH Zhou, L., Yau, S.: Efficient association rule mining among both frequent and infrequent items. Comput. Math Appl. 54(6), 737–749 (2007)MathSciNetCrossRefMATH
15.
Zurück zum Zitat Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., Coello, C.A.C.: A survey of multiobjective evolutionary algorithms for data mining: part i. IEEE Trans. Evol. Comput. 18(1), 4–19 (2014)CrossRef Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., Coello, C.A.C.: A survey of multiobjective evolutionary algorithms for data mining: part i. IEEE Trans. Evol. Comput. 18(1), 4–19 (2014)CrossRef
16.
Zurück zum Zitat Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Knowledge Discovery in Databases, pp. 229–248. AAAI/MIT Press, Menlo Park (1991) Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Knowledge Discovery in Databases, pp. 229–248. AAAI/MIT Press, Menlo Park (1991)
17.
Zurück zum Zitat Wakabi-Waiswa, P.P., Baryamureeba, V.: Extraction of interesting association rules using genetic algorithms. Int. J. Comput. ICT Res. 2(1), 101–110 (2008) Wakabi-Waiswa, P.P., Baryamureeba, V.: Extraction of interesting association rules using genetic algorithms. Int. J. Comput. ICT Res. 2(1), 101–110 (2008)
Metadaten
Titel
A New Evolutionary Algorithm for Extracting a Reduced Set of Interesting Association Rules
verfasst von
Mir Md. Jahangir Kabir
Shuxiang Xu
Byeong Ho Kang
Zongyuan Zhao
Copyright-Jahr
2015
DOI
https://doi.org/10.1007/978-3-319-26535-3_16