{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T05:11:11Z","timestamp":1773810671213,"version":"3.50.1"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T00:00:00Z","timestamp":1610496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ministry of Education"},{"name":"Science and Technology","award":["2018R1D1A1A09083"],"award-info":[{"award-number":["2018R1D1A1A09083"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2021,4,30]]},"abstract":"<jats:p>Databases that deal with the real world have various characteristics. New data is continuously inserted over time without limiting the length of the database, and a variety of information about the items constituting the database is contained. Recently generated data has a greater influence than the previously generated data. These are called the time-sensitive non-binary stream databases, and they include databases such as web-server click data, market sales data, data from sensor networks, and network traffic measurement. Many high utility pattern mining and stream pattern mining methods have been proposed so far. However, they have a limitation that they are not suitable to analyze these databases, because they find valid patterns by analyzing a database with only some of the features described above. Therefore, knowledge-based software about how to find meaningful information efficiently by analyzing databases with these characteristics is required. In this article, we propose an intelligent information system that calculates the influence of the insertion time of each batch in a large-scale stream database by applying the sliding window model and mines recent high utility patterns without generating candidate patterns. In addition, a novel list-based data structure is suggested for a fast and efficient management of the time-sensitive stream databases. Moreover, our technique is compared with state-of-the-art algorithms through various experiments using real datasets and synthetic datasets. The experimental results show that our approach outperforms the previously proposed methods in terms of runtime, memory usage, and scalability.<\/jats:p>","DOI":"10.1145\/3430767","type":"journal-article","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T17:15:00Z","timestamp":1610558100000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["RHUPS"],"prefix":"10.1145","volume":"12","author":[{"given":"Yoonji","family":"Baek","sequence":"first","affiliation":[{"name":"Sejong University, Seoul, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3720-0861","authenticated-orcid":false,"given":"Unil","family":"Yun","sequence":"additional","affiliation":[{"name":"Sejong University, Seoul, South Korea"}]},{"given":"Heonho","family":"Kim","sequence":"additional","affiliation":[{"name":"Sejong University, Seoul, South Korea"}]},{"given":"Hyoju","family":"Nam","sequence":"additional","affiliation":[{"name":"Sejong University, Seoul, South Korea"}]},{"given":"Hyunsoo","family":"Kim","sequence":"additional","affiliation":[{"name":"Sejong University, Seoul, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[{"name":"Western Norway University of Applied Sciences, Bergen, Norway"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[{"name":"Ho Chi Minh City University of Technology (HUTECH), Ho Chi Minh City, Vietnam"}]},{"given":"Witold","family":"Pedrycz","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton AB, Canada"}]}],"member":"320","published-online":{"date-parts":[[2021,1,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.03.062"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326163"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.10.039"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3876-4"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.09.007"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2997409"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2700484"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2007.07.026"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Q.-H. Duong H. Ramampiaro K. N\u00f8rv\u00e5g P. Fournier-Viger and T.-L. Dam. 2018. High utility drift detection in quantitative data streams. Knowl.-based Syst. 157 34--51.  Q.-H. Duong H. Ramampiaro K. N\u00f8rv\u00e5g P. Fournier-Viger and T.-L. Dam. 2018. High utility drift detection in quantitative data streams. Knowl.-based Syst. 157 34--51.","DOI":"10.1016\/j.knosys.2018.05.014"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the International Symposium on Methodologies for Intelligent Systems. 83--92","author":"Fournier-Viger P.","unstructured":"P. Fournier-Viger , C.-W. Wu , S. Zida , and V. S. Tseng . 2014. FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning . In Proceedings of the International Symposium on Methodologies for Intelligent Systems. 83--92 . P. Fournier-Viger, C.-W. Wu, S. Zida, and V. S. Tseng. 2014. FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In Proceedings of the International Symposium on Methodologies for Intelligent Systems. 83--92."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2896267"},{"key":"e_1_2_1_13_1","article-title":"A survey of utility-oriented pattern mining","volume":"10","author":"Gan W.","year":"2019","unstructured":"W. Gan , J. C.-W. Lin , P. Fournier-Viger , H.-C. Chao , V. S. Tseng , and P. S. Yu . 2019 . A survey of utility-oriented pattern mining . IEEE Trans. Knowl. Data Eng. DOI : 10 .1109\/TKDE.2019.2942594 10.1109\/TKDE.2019.2942594 W. Gan, J. C.-W. Lin, P. Fournier-Viger, H.-C. Chao, V. S. Tseng, and P. S. Yu. 2019. A survey of utility-oriented pattern mining. IEEE Trans. Knowl. Data Eng. DOI:10.1109\/TKDE.2019.2942594","journal-title":"IEEE Trans. Knowl. Data Eng. DOI"},{"key":"e_1_2_1_14_1","unstructured":"W. Gan J. C.-W. Lin H.-C. Chao P. Fournier-Viger X. Wang and P. S. Yu. 2019. Utility-driven mining of trend information for intelligent system. CoRR abs\/1912.11666.  W. Gan J. C.-W. Lin H.-C. Chao P. Fournier-Viger X. Wang and P. S. Yu. 2019. Utility-driven mining of trend information for intelligent system. CoRR abs\/1912.11666."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1242"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43946-4_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-160861"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.09.051"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1280-5"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.09.010"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01412-9"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2976662"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.10.010"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40815-018-0520-5"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2801261"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0991-3"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2015.06.002"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.06.009"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPCN.2018.093234"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2919524"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3173458"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2008.10.060"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the Advances in Knowledge Discovery and Data Mining Conference (PAKDD\u201905)","author":"Liu Y.","unstructured":"Y. Liu , W.-K. Liao , and A. N. Choudhary . 2005. A two-phase algorithm for fast discovery of high utility itemsets . In Proceedings of the Advances in Knowledge Discovery and Data Mining Conference (PAKDD\u201905) . 689--695. Y. Liu, W.-K. Liao, and A. N. Choudhary. 2005. A two-phase algorithm for fast discovery of high utility itemsets. In Proceedings of the Advances in Knowledge Discovery and Data Mining Conference (PAKDD\u201905). 689--695."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"H. Nam U. Yun E. Yoon and J. C.-W. Lin. 2020. Efficient approach for incremental weighted erasable pattern mining with list structure. Exp. Syst. Applic. 143.  H. Nam U. Yun E. Yoon and J. C.-W. Lin. 2020. Efficient approach for incremental weighted erasable pattern mining with list structure. Exp. Syst. Applic. 143.","DOI":"10.1016\/j.eswa.2019.113087"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3200764"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.001"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1316-x"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833478"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2992729"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178114"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"J. Wu J. Zhan and J. Lin. 2017. An ACO-based approach to mine high-utility itemsets. Knowl.-based Syst. 116 15 (2017) 102--113.  J. Wu J. Zhan and J. Lin. 2017. An ACO-based approach to mine high-utility itemsets. Knowl.-based Syst. 116 15 (2017) 102--113.","DOI":"10.1016\/j.knosys.2016.10.027"},{"key":"e_1_2_1_44_1","first-page":"71","article-title":"A model of mining approximate frequent itemsets using rough set theory","volume":"19","author":"Yu X.","year":"2019","unstructured":"X. Yu , J. Zhao , H. Wang , X. Zheng , and X. Yan . 2019 . A model of mining approximate frequent itemsets using rough set theory . Int. J. Comput. Sci. Eng. 19 , 1 (2019), 71 -- 82 . X. Yu, J. Zhao, H. Wang, X. Zheng, and X. Yan. 2019. A model of mining approximate frequent itemsets using rough set theory. Int. J. Comput. Sci. Eng. 19, 1 (2019), 71--82.","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.04.050"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.12.029"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"U. Yun D. Kim E. Yoon and H. Fujita. 2018. Damped window based high average utility pattern mining over data streams. Knowl.-based Syst. 144 (2018) 188--205.  U. Yun D. Kim E. Yoon and H. Fujita. 2018. Damped window based high average utility pattern mining over data streams. Knowl.-based Syst. 144 (2018) 188--205.","DOI":"10.1016\/j.knosys.2017.12.029"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2017.2682782"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"U. Yun H. Ryang G. Lee and H. Fujita. 2017. An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl.-based Syst. 124 (2017) 188--206.  U. Yun H. Ryang G. Lee and H. Fujita. 2017. An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl.-based Syst. 124 (2017) 188--206.","DOI":"10.1016\/j.knosys.2017.03.016"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0601-6"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3430767","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3430767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:41Z","timestamp":1750195481000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3430767"}},"subtitle":["Mining Recent High Utility Patterns with Sliding Window\u2013based Arrival Time Control over Data Streams"],"short-title":[],"issued":{"date-parts":[[2021,1,13]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4,30]]}},"alternative-id":["10.1145\/3430767"],"URL":"https:\/\/doi.org\/10.1145\/3430767","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,13]]},"assertion":[{"value":"2020-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}