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

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.

[1]  Diyar Akay,et al.  Fuzzy Quantification and Opinion Mining on Qualitative Data using Feature Reduction , 2018, Int. J. Intell. Syst..

[2]  Gholam R. Amin,et al.  Measuring global prosperity using data envelopment analysis and OWA operator , 2019, Int. J. Intell. Syst..

[3]  Hamido Fujita,et al.  An efficient algorithm for mining high utility patterns from incremental databases with one database scan , 2017, Knowl. Based Syst..

[4]  Mengchi Liu,et al.  Mining high utility itemsets without candidate generation , 2012, CIKM.

[5]  Tzung-Pei Hong,et al.  An efficient algorithm to mine high average-utility itemsets , 2016, Adv. Eng. Informatics.

[6]  Piotr Honko,et al.  Properties of a Granular Computing Framework for Mining Relational Data , 2017, Int. J. Intell. Syst..

[7]  Philippe Fournier-Viger,et al.  Efficient Vertical Mining of High Average-Utility Itemsets Based on Novel Upper-Bounds , 2019, IEEE Transactions on Knowledge and Data Engineering.

[8]  Unil Yun,et al.  Mining of high average-utility itemsets using novel list structure and pruning strategy , 2017, Future Gener. Comput. Syst..

[9]  Takayuki Yamada,et al.  Data mining based on clustering and association rule analysis for knowledge discovery in multiobjective topology optimization , 2019, Expert Syst. Appl..

[10]  Ying Liu,et al.  A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets , 2005, PAKDD.

[11]  Durga Toshniwal,et al.  Frequent Pattern Mining on Time and Location Aware Air Quality Data , 2019, IEEE Access.

[12]  Ronghui Wu,et al.  Top-k high average-utility itemsets mining with effective pruning strategies , 2018, Applied Intelligence.

[13]  Unil Yun,et al.  Mining high utility itemsets based on the time decaying model , 2016, Intell. Data Anal..

[14]  Philip S. Yu,et al.  Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases , 2013, IEEE Transactions on Knowledge and Data Engineering.

[15]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[16]  Srikumar Krishnamoorthy,et al.  Pruning strategies for mining high utility itemsets , 2015, Expert Syst. Appl..

[17]  Young-Koo Lee,et al.  Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases , 2009, IEEE Transactions on Knowledge and Data Engineering.

[18]  Unil Yun,et al.  A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives , 2017, Future Gener. Comput. Syst..

[19]  Tzung-Pei Hong,et al.  Efficiently Mining High Average-Utility Itemsets with an Improved Upper-Bound Strategy , 2012, Int. J. Inf. Technol. Decis. Mak..

[20]  Tzung-Pei Hong,et al.  A Projection-Based Approach for Discovering High Average-Utility Itemsets , 2012, J. Inf. Sci. Eng..

[21]  Philippe Fournier-Viger,et al.  ETARM: an efficient top-k association rule mining algorithm , 2017, Applied Intelligence.

[22]  Xiangling Fu,et al.  A decision‐making algorithm for online shopping using deep‐learning–based opinion pairs mining and q‐rung orthopair fuzzy interaction Heronian mean operators , 2020, Int. J. Intell. Syst..

[23]  Tzung-Pei Hong,et al.  An Incremental Mining Algorithm for High Average-Utility Itemsets , 2009, 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks.

[24]  Jimmy Ming-Tai Wu,et al.  TUB-HAUPM: Tighter Upper Bound for Mining High Average-Utility Patterns , 2018, IEEE Access.

[25]  Ling Chen,et al.  Mining frequent items in data stream using time fading model , 2014, Inf. Sci..

[26]  Hamido Fujita,et al.  Damped window based high average utility pattern mining over data streams , 2017, Knowl. Based Syst..

[27]  Tzung-Pei Hong,et al.  Mining high average-utility itemsets , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[28]  Won Suk Lee,et al.  Finding recently frequent itemsets adaptively over online transactional data streams, , 2006, Inf. Syst..

[29]  Vincent S. Tseng,et al.  Mining high-utility itemsets in dynamic profit databases , 2019, Knowl. Based Syst..

[30]  Kuldeep Singh,et al.  EHNL: An efficient algorithm for mining high utility itemsets with negative utility value and length constraints , 2019, Inf. Sci..

[31]  Heungmo Ryang,et al.  Mining recent high average utility patterns based on sliding window from stream data , 2016, J. Intell. Fuzzy Syst..

[32]  Yao Ge,et al.  Top-k frequent items and item frequency tracking over sliding windows of any size , 2019, Inf. Sci..

[33]  Piotr Honko,et al.  Upgrading a Granular Computing Based Data Mining Framework to a Relational Case , 2014, Int. J. Intell. Syst..

[34]  Imtiaz Ahmad,et al.  SAT‐based and CP‐based declarative approaches for Top‐Rank‐K closed frequent itemset mining , 2021, Int. J. Intell. Syst..

[35]  Unil Yun,et al.  Efficient algorithm for mining high average-utility itemsets in incremental transaction databases , 2017, Applied Intelligence.

[36]  Unil Yun,et al.  Efficient approach for incremental high utility pattern mining with indexed list structure , 2019, Future Gener. Comput. Syst..

[37]  Unil Yun,et al.  Single-pass based efficient erasable pattern mining using list data structure on dynamic incremental databases , 2018, Future Gener. Comput. Syst..

[38]  Yang Chen,et al.  Association rule mining based parameter adaptive strategy for differential evolution algorithms , 2019, Expert Syst. Appl..

[39]  Shruti Kohli,et al.  OWA Operator‐Based Hybrid Framework for Outlier Reduction in Web Mining , 2016, Int. J. Intell. Syst..

[40]  Tzung-Pei Hong,et al.  A New Method for Mining High Average Utility Itemsets , 2014, CISIM.

[41]  Hamido Fujita,et al.  Efficiently mining erasable stream patterns for intelligent systems over uncertain data , 2020, Int. J. Intell. Syst..

[42]  Heungmo Ryang,et al.  High utility pattern mining over data streams with sliding window technique , 2016, Expert Syst. Appl..

[43]  Xiaowei Gu,et al.  Empirical Data Analytics , 2017, Int. J. Intell. Syst..

[44]  Jieh-Shan Yeh,et al.  Efficient algorithms for incremental utility mining , 2008, ICUIMC '08.

[45]  Heungmo Ryang,et al.  Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques , 2017, Knowledge and Information Systems.

[46]  Unil Yun,et al.  Efficient High Utility Pattern Mining for Establishing Manufacturing Plans With Sliding Window Control , 2017, IEEE Transactions on Industrial Electronics.

[47]  Philippe Fournier-Viger,et al.  A fast algorithm for mining high average-utility itemsets , 2017, Applied Intelligence.

[48]  Philippe Fournier-Viger,et al.  FHM + : Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction , 2016, IEA/AIE.

[49]  Vicente García-Díaz,et al.  Real‐time force doors detection system using distributed sensors and neural networks , 2019, Int. J. Intell. Syst..

[50]  Heungmo Ryang,et al.  Incremental high utility pattern mining with static and dynamic databases , 2014, Applied Intelligence.

[51]  Vincent S. Tseng,et al.  FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning , 2014, ISMIS.

[52]  Philip S. Yu,et al.  HUOPM: High-Utility Occupancy Pattern Mining , 2018, IEEE Transactions on Cybernetics.

[53]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.