skip to main content
research-article

Average utility driven data analytics on damped windows for intelligent systems with data streams

Published: 26 August 2021 Publication History

Abstract

In industrial areas, most of databases are dynamic databases, and the volume of the databases has grown with the passage of time. Especially, pattern mining for incremental database needs different approaches from static database because the profit or the accuracy of the previously inserted data can be reduced. Since data is time‐ sensitive, the recent data has a relatively higher value than the old data. In this paper, we suggest the damped window based average utility driven data analytics for intelligent systems, which the damped window reflects the importance according to the arrival time of the transactions. The proposed mining approach adopts novel data structure, which modify the importance of item as the passage of time, and it improves mining efficiency with several pruning strategies and without generating candidate patterns. To evaluate the performance of the proposed mining approach, we conducted various experiments using several real and synthetic data sets. The result of the experiments presented that the suggested method performs better in terms of runtime and memory usage than the other state‐of‐the‐art mining techniques. Moreover, through the scalability experiments, which changed the number of different items or transactions, we verified that the proposed algorithm maintained a stable performance under various environmental changes.

References

[1]
Amin GR, Siddiq FK. Measuring global prosperity using data envelopment analysis and OWA operator. Int J Intell Syst. 2019;34(10):2713‐2738.
[2]
Angelov P, Gu X, Kangin D. Empirical data analytics. Int J Intell Syst. 2017;32(12):1261‐1284.
[3]
Dündar B, Akay D, Boran FE, Özdemir S. Fuzzy quantification and opinion mining on qualitative data using feature reduction. Int J Intell Syst. 2017;33(9):1840‐1857.
[4]
Yang Z, Ouyang T, Fu X, Peng X. A decision‐making algorithm for online shopping using deep‐learning‐based opinion pairs mining and q‐rung orthopair fuzzy interaction. Int J Intell Syst. 2020;35(5):783‐825.
[5]
Hońko P. Upgrading a granular computing based data mining framework to a relational case. Int J Intell Syst. 2014;29(5):407‐438.
[6]
Hońko P. Properties of a granular computing framework for mining relational data. Int J Intell Syst. 2016;32(3):227‐248.
[7]
Gupta A, Kohli S. OWA operator‐based hybrid framework for outlier reduction in web mining. Int J Intell Syst. 2016;31(10):947‐962.
[8]
Nguyen LTT, Vo B, Nguyen LTT, Fournier‐Viger P, Selamat A. ETARM: an efficient top‐k association rule mining algorithm. Appl Intell. 2018;48(5):1148‐1160.
[9]
Sato Y, Izui K, Yamada T, Nishiwaki S. Data mining based on clustering and association rule analysis for knowledge discovery in multiobjective topology optimization. Expert Syst Appl. 2019;119:247‐261.
[10]
Wang C, Liu Y, Zhang Q, et al. Association rule mining based parameter adaptive strategy for differential evolution algorithms. Expert Syst Appl. 2019;123:54‐69.
[11]
Abed S, Abdelaal AA, AlShayeji MH, Ahmad I. SAT‐based and CP‐based declarative approaches for Top‐Rank‐K closed frequent itemset mining. Int J Intell Syst. 2021;36(1):112‐151.
[12]
Aggarwal A, Toshniwal D. Frequent pattern mining on time and location aware air quality data. IEEE Access. 2019;7:98921‐98933.
[13]
Song C, Liu X, Ge T, Ge Y. Top‐k frequent items and item frequency tracking over sliding windows of any size. Inform Sci. 2019;475:100‐120.
[14]
Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. In: 20th International Conference on Very Large Data Bases, 1994:487‐499.
[15]
Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In: SIGMOD Conference; 2000:1‐12.
[16]
Baek Y, Yun U, Lin JCW, Yoon E, Fujita H. Efficiently mining erasable stream patterns for intelligent systems over uncertain data. Int J Intell Syst. 2020;35(11):1699‐1734.
[17]
Lee G, Yun U. Single‐pass based efficient erasable pattern mining using list data structure on dynamic incremental databases. Future Generation Comput Syst. 2018;80:12‐28.
[18]
Lee G, Yun U. A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives. Future Generation Comput Syst. 2017;68:89‐110.
[19]
Gan W, Lin JCW, Fournier‐Viger P, Chao HC, Yu PS. HUOPM: high‐utility occupancy pattern mining. IEEE Trans Cybernet. 2020;50(3):1195‐1208.
[20]
Nguyen LTT, Nguyen P, Nguyen TDD, Vo B, Fournier‐Viger P, Tseng VS. Mining high‐utility itemsets in dynamic profit databases. Knowl‐Based Syst. 2019;175:130‐144.
[21]
Singh K, Kumar A, Singh SS, Shakya HK, Biswas B. EHNL: an efficient algorithm for mining high utility itemsets with negative utility value and length constraints. Inform Sci. 2019;484:44‐70.
[22]
Lan GC, Hong TP, Tseng VS. Efficiently mining high average‐utility itemsets with an improved upper‐bound strategy. Int J Inform Technol Decision Making. 2012;11(5):1009‐1030.
[23]
Lin JCW, Ren S, Fournier‐Viger P, Hong TP, Su JH, Vo B. A fast algorithm for mining high average‐utility itemsets. Appl Intell. 2017;47(2):331‐346.
[24]
Wu JMT, Lin JCW, Pirouz M, Fournier‐Viger P. TUB‐HAUPM: tighter upper bound for mining high average‐utility patterns. IEEE Access. 2018;6:18655‐18669.
[25]
Wu R, He Z. Top‐k high average‐utility itemsets mining with effective pruning strategies. Appl Intell. 2018;48(10):3429‐3445.
[26]
Espada JP, García‐Díaz V, Núñez‐Valdéz ER, Crespo RG. Real‐time force doors detection system using distributed sensors and neural networks. International J Intell Syst. 2019;34(9):2243‐2252.
[27]
Ryang H, Yun U. High utility pattern mining over data streams with sliding window technique. Expert Syst Appl. 2016;57:214‐231.
[28]
Yun U, Kim D, Ryang H, Lee G, Lee K. Mining recent high average utility patterns based on sliding window from stream data. J Intell Fuzzy Syst. 2016;30(6):3605‐3617.
[29]
Yun U, Lee G, Yoon E. Efficient high utility pattern mining for establishing manufacturing plans with sliding window control. IEEE Trans Industr Electron. 2017;64(9):7239‐7249.
[30]
Chang J, Lee W. Finding recently frequent itemsets adaptively over online transactional data streams. Inform Syst. 2006;31(8):849‐869.
[31]
Kim D, Yun U. Efficient algorithm for mining high average‐utility itemsets in incremental transaction databases. Appl Intell. 2017;47(1):114‐131.
[32]
Yun U, Nam H, Lee G, Yoon E. Efficient approach for incremental high utility pattern mining with indexed list structure. Future Generation Comput Syst. 2019;95:221‐239.
[33]
Liu Y, Liao WK, Choudhary AN. A two‐phase algorithm for fast discovery of high utility itemsets. PAKDD. 2005:689‐695.
[34]
Tseng VS, Shie BE, Wu CW, Yu PS. Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng. 2013;25(8):1772‐1786.
[35]
Liu M, Qu JF. Mining high utility itemsets without candidate generation. CIKM. 2012;7:55‐64.
[36]
Krishnamoorthy S. Pruning strategies for mining high utility itemsets. Expert Syst Appl. 2015;42(5):2371‐2381.
[37]
Fournier‐Viger P, Wu CW, Zida S, Tseng VS. FHM: faster high‐utility itemset mining using estimated utility co‐occurrence pruning. ISMIS. 2014:83‐92.
[38]
Fournier‐Viger P, Lin JCW, Duong QH, Dam TL. FHM +: faster high‐utility itemset mining using length upper‐bound reduction. IEA/AIE. 2016:115‐127.
[39]
Ryang H, Yun U. Indexed list‐based high utility pattern mining with utility upper‐bound reduction and pattern combination techniques. Knowl Inform Syst. 2017;51(2):627‐659.
[40]
Yeh JS, Chang CS, Wang YT. Efficient algorithms for incremental utility mining. ICUIMC. 2008:212‐217.
[41]
Ahmed DF, Tanbeer SK, Jeong B, Lee Y. Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng. 2009;21(12):1708‐1721.
[42]
Yun U, Ryang H. Incremental high utility pattern mining with static and dynamic databases. Appl Intell. 2015;42(2):323‐352.
[43]
Yun U, Ryang H, Lee G, Fujita H. An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl‐Based Syst. 2017;124:188‐206.
[44]
Hong TP, Lee CH, Wang SL. Mining high average‐utility itemsets. SMC. 2009:2526‐2530.
[45]
Lan GC, Hong TP, Tseng VS. A projection‐based approach for discovering high average‐utility itemsets. J Inform Sci Eng. 2012;28(1):193‐209.
[46]
Lu T, Vo B, Nguyen HT, Hong TP. A new method for mining high average utility itemsets. CISIM. 2014:33‐42.
[47]
Lin JCW, Li T, Fournier‐Viger P, Hong TP, Zhan J, Voznak M. An efficient algorithm to mine high average‐utility itemsets. Adv Eng Inform. 2016;30(2):233‐243.
[48]
Yun U, Kim D. Mining of high average‐utility itemsets using novel list structure and pruning strategy. Future Generation Comput Syst. 2017;68:346‐360.
[49]
Truong TC, Duong HV, Le B, Fournier‐Viger P. Efficient vertical mining of high average‐utility itemsets based on novel upper‐bounds. IEEE Trans Knowl Data Eng. 2019;31(2):301‐314.
[50]
Hong TP, Lee CH, Wang SL. An incremental mining algorithm for high average‐utility itemsets. ISPAN. 2009:421‐425.
[51]
Kim D, Yun U. Mining high utility itemsets based on the time decaying model. Intell Data Anal. 2016;20(5):1157‐1180.
[52]
Yun U, Kim D, Yoon E, Fujita H. Damped window based high average utility pattern mining over data streams. Knowl‐Based Syst. 2018;144:188‐205.
[53]
Chen L, Mei Q. Mining frequent items in data stream using time fading model. Inf Sci. 2014;257:54‐69.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image International Journal of Intelligent Systems
International Journal of Intelligent Systems  Volume 36, Issue 10
October 2021
772 pages
ISSN:0884-8173
DOI:10.1002/int.v36.10
Issue’s Table of Contents

Publisher

John Wiley and Sons Ltd.

United Kingdom

Publication History

Published: 26 August 2021

Author Tags

  1. average utility driven data analytics
  2. damped window
  3. data mining
  4. data streams

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media