Skip to main content
Top
Published in: International Journal of Parallel Programming 5/2020

05-12-2018

High Utility Infrequent Itemset Mining Using a Customized Ant Colony Algorithm

Authors: M. S. Arunkumar, P. Suresh, C. Gunavathi

Published in: International Journal of Parallel Programming | Issue 5/2020

Log in

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

search-config
loading …

Abstract

Itemset mining is a popular extension to the frequent pattern mining problem in data mining. Finding infrequent patterns, however, has gained its importance due to proven utility in the areas of web mining, bioinformatics and others. High utility mining refines the problem focus to identifying business-relevant transaction patterns that take purchase quantities and monetary considerations into account, like unit price and cost, typically to identify patterns of profit potential. High utility infrequent itemset mining unveils rare cases of highly profitable itemsets. This paper proposes a customized Ant colony algorithm for the efficient discovery of high utility infrequent itemsets. The mining performance of proposed algorithm is analyzed on four real time datasets namely chess, food mart, mushroom and retail.

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 "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!

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!

Literature
1.
go back to reference Agarwal, R., Imielinski, T., Swami, A.: Mining association rules between sets of item in large databases. In: Proceedings of the ACM SIGMOD, Washington DC, USA (1993) Agarwal, R., Imielinski, T., Swami, A.: Mining association rules between sets of item in large databases. In: Proceedings of the ACM SIGMOD, Washington DC, USA (1993)
2.
go back to reference Agarwal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on VLDB, Santiago, Chile, pp. 487–499 (1994) Agarwal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on VLDB, Santiago, Chile, pp. 487–499 (1994)
3.
go back to reference Han, J., Pie, J.: Mining frequent patterns by pattern-growth: methodology and implications. ACM SIGKDD Explorations Newsl 2(2), 14–20 (2000)CrossRef Han, J., Pie, J.: Mining frequent patterns by pattern-growth: methodology and implications. ACM SIGKDD Explorations Newsl 2(2), 14–20 (2000)CrossRef
4.
go back to reference Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: 3rd IEEE Conference on Data Mining, pp. 19–26 (2003) Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: 3rd IEEE Conference on Data Mining, pp. 19–26 (2003)
5.
go back to reference Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. In: STACS 2002, vol. 2285, pp. 133–141 (2002) Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. In: STACS 2002, vol. 2285, pp. 133–141 (2002)
6.
go back to reference Pillai, J., Vyas, O.P., Muyeba, M.: HURI—A novel algorithm for mining high utility rare itemsets. Adv. Intell. Syst. Comput. 177, 531–540 (2013) Pillai, J., Vyas, O.P., Muyeba, M.: HURI—A novel algorithm for mining high utility rare itemsets. Adv. Intell. Syst. Comput. 177, 531–540 (2013)
7.
go back to reference Haglin, D.J., Manning, A.M.: On minimal infrequent itemset mining. In: Proceedings of DIMN’ 07, pp. 141–147 (2007) Haglin, D.J., Manning, A.M.: On minimal infrequent itemset mining. In: Proceedings of DIMN’ 07, pp. 141–147 (2007)
8.
go back to reference Gupta, D., Chauhan, A.S.: Ant colony based optimization from infrequent itemsets. In: Proceedings of the 3rd International Conference FICTA, pp. 797–804 (2014) Gupta, D., Chauhan, A.S.: Ant colony based optimization from infrequent itemsets. In: Proceedings of the 3rd International Conference FICTA, pp. 797–804 (2014)
9.
go back to reference Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)CrossRef Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)CrossRef
10.
go back to reference Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proceedings KDD-97, pp. 283–286 (1997) Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proceedings KDD-97, pp. 283–286 (1997)
11.
go back to reference Xun, Y., Zhang, J., Qin, X.: FiDoop: parallel mining of frequent itemsets using MapReduce. IEEE Trans. Syst. Man. Cybern. Syst. 46(3), 313–325 (2016)CrossRef Xun, Y., Zhang, J., Qin, X.: FiDoop: parallel mining of frequent itemsets using MapReduce. IEEE Trans. Syst. Man. Cybern. Syst. 46(3), 313–325 (2016)CrossRef
12.
go back to reference Goyal, P., Challa, J.S., Shrivastava, S., Goyal, N.: AnyFI: an anytime frequent itemset mining algorithm for data streams. In: 2017 IEEE International Conference on Big Data (Big Data), Boston, MA, pp. 942–947 (2017) Goyal, P., Challa, J.S., Shrivastava, S., Goyal, N.: AnyFI: an anytime frequent itemset mining algorithm for data streams. In: 2017 IEEE International Conference on Big Data (Big Data), Boston, MA, pp. 942–947 (2017)
13.
go back to reference Kulkarni, P.G., Khonde, S.R.: HDFS framework for efficient frequent itemset mining using MapReduce. In: 2017 1st International Conference on Intelligent Systems and Information Management (ICISIM), Aurangabad, pp. 171–178 (2017) Kulkarni, P.G., Khonde, S.R.: HDFS framework for efficient frequent itemset mining using MapReduce. In: 2017 1st International Conference on Intelligent Systems and Information Management (ICISIM), Aurangabad, pp. 171–178 (2017)
14.
go back to reference Zhao, X., Zhang, X., Wang, P., Chen, S., Sun, Z.: A weighted frequent itemset mining algorithm for intelligent decision in smart systems. IEEE Access 6, 29271–29282 (2018)CrossRef Zhao, X., Zhang, X., Wang, P., Chen, S., Sun, Z.: A weighted frequent itemset mining algorithm for intelligent decision in smart systems. IEEE Access 6, 29271–29282 (2018)CrossRef
15.
go back to reference Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. PAKDD 2005, 689–695 (2005) Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. PAKDD 2005, 689–695 (2005)
16.
go back to reference Erwin, A., Gopalan, R.P., Achuthan, N.R.: CTU-Mine: an efficient high utility itemset mining algorithm using the pattern growth approach. In: 7th IEEE International Conference on Computer and Information Technology, pp. 71–76 (2007) Erwin, A., Gopalan, R.P., Achuthan, N.R.: CTU-Mine: an efficient high utility itemset mining algorithm using the pattern growth approach. In: 7th IEEE International Conference on Computer and Information Technology, pp. 71–76 (2007)
17.
go back to reference Zhou, L., Liu, Y., Wang, J., Shi, Y.: Utility-based web path traversal pattern mining. In: 7th IEEE ICDMW, pp. 373–378 (2007) Zhou, L., Liu, Y., Wang, J., Shi, Y.: Utility-based web path traversal pattern mining. In: 7th IEEE ICDMW, pp. 373–378 (2007)
18.
go back to reference 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
19.
go back to reference Fournier-Viger, P., Wu, C.W., Zida, S., Tseng, V.S.: Faster high utility itemset mining using estimated utility co-occurrence pruning. In: Proceedings of the 21st ISMIS 2014, pp. 83–92 (2014) Fournier-Viger, P., Wu, C.W., Zida, S., Tseng, V.S.: Faster high utility itemset mining using estimated utility co-occurrence pruning. In: Proceedings of the 21st ISMIS 2014, pp. 83–92 (2014)
20.
go back to reference Zida, S., Fouriner-Viger, P., Lin, J.C.W., Wu, C.W., Tseng, V.S.: EFIM: a highly efficient algorithm for high utility itemset mining. Adv. Artif. Intell. Soft Comput. 9413, 530–546 (2015)CrossRef Zida, S., Fouriner-Viger, P., Lin, J.C.W., Wu, C.W., Tseng, V.S.: EFIM: a highly efficient algorithm for high utility itemset mining. Adv. Artif. Intell. Soft Comput. 9413, 530–546 (2015)CrossRef
21.
go back to reference Arunkumar, M.S., Suresh, P., Gunavathi, C.: High utility itemset mining using partition utility list structure. J. Comput. Theor. Nanosci. 15(1), 171–178 (2018)CrossRef Arunkumar, M.S., Suresh, P., Gunavathi, C.: High utility itemset mining using partition utility list structure. J. Comput. Theor. Nanosci. 15(1), 171–178 (2018)CrossRef
22.
go back to reference Fournier-Viger, P., Zhang, Y., Lin, J.C.-W., Dinh, D.-T., Le, H.B.: Mining correlated high-utility itemsets using various measures. Logic J IGPL (2018) Fournier-Viger, P., Zhang, Y., Lin, J.C.-W., Dinh, D.-T., Le, H.B.: Mining correlated high-utility itemsets using various measures. Logic J IGPL (2018)
23.
go back to reference Pillai, J., Vyas, O.P., Muyeba, M.K.: A fuzzy algorithm for mining high utility rare itemsets—FHURI. Int. J. Recent Trends Eng. Technol. 10(1), 1 (2014)CrossRef Pillai, J., Vyas, O.P., Muyeba, M.K.: A fuzzy algorithm for mining high utility rare itemsets—FHURI. Int. J. Recent Trends Eng. Technol. 10(1), 1 (2014)CrossRef
24.
go back to reference Niha, S.A.R., Dulhare, U.N.: Extraction of high utility rare itemsets from transactional databases. In: International Conference on Computing and Communication Technologies, Hyderabad, pp. 1–6 (2014) Niha, S.A.R., Dulhare, U.N.: Extraction of high utility rare itemsets from transactional databases. In: International Conference on Computing and Communication Technologies, Hyderabad, pp. 1–6 (2014)
25.
go back to reference Pillai, J., Vyas, O.P.: CSHURI—modified HURI algorithm for customer segmentation and transaction profitability. Adv. Int. J. Comput. Sci. Eng. Inf. Technol. 2(2), 79–89 (2012) Pillai, J., Vyas, O.P.: CSHURI—modified HURI algorithm for customer segmentation and transaction profitability. Adv. Int. J. Comput. Sci. Eng. Inf. Technol. 2(2), 79–89 (2012)
26.
go back to reference Goyal, V., Dawar, S., Sureka, A.: High utility rare itemset mining over transaction databases. In: Chu, W., Kikuchi, S., Bhalla, S. (eds.) Databases in Networked Information Systems. DNIS 2015. Lecture Notes in Computer Science, vol. 8999. Springer, Cham (2015) Goyal, V., Dawar, S., Sureka, A.: High utility rare itemset mining over transaction databases. In: Chu, W., Kikuchi, S., Bhalla, S. (eds.) Databases in Networked Information Systems. DNIS 2015. Lecture Notes in Computer Science, vol. 8999. Springer, Cham (2015)
27.
go back to reference Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975) Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)
28.
go back to reference Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence Through Simulated Evolution. Wiley, New York (1966)MATH Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence Through Simulated Evolution. Wiley, New York (1966)MATH
29.
go back to reference Wu, J.M.T., Zhan, J., Lin, V.: An ACO-based approach to mine high utility itemsets. Knowl. Based Syst. 116, 102–113 (2017)CrossRef Wu, J.M.T., Zhan, J., Lin, V.: An ACO-based approach to mine high utility itemsets. Knowl. Based Syst. 116, 102–113 (2017)CrossRef
Metadata
Title
High Utility Infrequent Itemset Mining Using a Customized Ant Colony Algorithm
Authors
M. S. Arunkumar
P. Suresh
C. Gunavathi
Publication date
05-12-2018
Publisher
Springer US
Published in
International Journal of Parallel Programming / Issue 5/2020
Print ISSN: 0885-7458
Electronic ISSN: 1573-7640
DOI
https://doi.org/10.1007/s10766-018-0621-7

Other articles of this Issue 5/2020

International Journal of Parallel Programming 5/2020 Go to the issue

Premium Partner