Damped window based high average utility pattern mining over data streams

作者: Unil Yun , Donggyu Kim , Eunchul Yoon , Hamido Fujita

DOI: 10.1016/J.KNOSYS.2017.12.029

关键词:

摘要: Abstract Data mining methods have been required in both commercial and non-commercial areas. In such circumstances, pattern techniques can be used to find meaningful information. Utility (UPM) is more suitable for evaluating the usefulness of patterns. The method introduced this paper employs high average utility (HAUPM) approach, which one UPM approaches discovers interesting patterns items relations among another by using a novel measure. Meanwhile, past research on algorithms mainly focus tasks processing static database as batch operations. Most continuous, unbounded stream data constantly produced from heart beat sensors should treated differently with respect importance because up-to-date may higher influence than old data. Therefore, our approach also adopts concept damped window model gain useful environments. Various experiments are performed real datasets order demonstrate that designed not only provides important, recent information but requires less computational resources execution time, memory usage, scalability significant test.

参考文章(57)
Jingsong Zhang, Yinglin Wang, Dingyu Yang, CCSpan: Mining closed contiguous sequential patterns Knowledge Based Systems. ,vol. 89, pp. 1- 13 ,(2015) , 10.1016/J.KNOSYS.2015.06.014
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Gangin Lee, Unil Yun, Heungmo Ryang, Mining weighted erasable patterns by using underestimated constraint-based pruning technique Journal of Intelligent and Fuzzy Systems. ,vol. 28, pp. 1145- 1157 ,(2015) , 10.3233/IFS-141398
Gangin Lee, Unil Yun, Heungmo Ryang, An uncertainty-based approach: Frequent itemset mining from uncertain data with different item importance Knowledge-Based Systems. ,vol. 90, pp. 239- 256 ,(2015) , 10.1016/J.KNOSYS.2015.08.018
GUO-CHENG LAN, TZUNG-PEI HONG, VINCENT S. TSENG, EFFICIENTLY MINING HIGH AVERAGE-UTILITY ITEMSETS WITH AN IMPROVED UPPER-BOUND STRATEGY International Journal of Information Technology and Decision Making. ,vol. 11, pp. 1009- 1030 ,(2012) , 10.1142/S0219622012500307
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee, DSM-FI: an efficient algorithm for mining frequent itemsets in data streams Knowledge and Information Systems. ,vol. 17, pp. 79- 97 ,(2008) , 10.1007/S10115-007-0112-4
Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas, Assessing data mining results via swap randomization ACM Transactions on Knowledge Discovery From Data. ,vol. 1, pp. 14- ,(2007) , 10.1145/1297332.1297338
Wilhelmiina Hämäläinen, Matti Nykänen, Efficient Discovery of Statistically Significant Association Rules international conference on data mining. pp. 203- 212 ,(2008) , 10.1109/ICDM.2008.144
Heungmo Ryang, Unil Yun, Top-k high utility pattern mining with effective threshold raising strategies Knowledge-Based Systems. ,vol. 76, pp. 109- 126 ,(2015) , 10.1016/J.KNOSYS.2014.12.010
Bai-En Shie, Philip S. Yu, Vincent S. Tseng, Efficient algorithms for mining maximal high utility itemsets from data streams with different models Expert Systems With Applications. ,vol. 39, pp. 12947- 12960 ,(2012) , 10.1016/J.ESWA.2012.05.035