Taewoong Ryu , Doyoung Kim , Seungwan Park, Seongbin Park, Myungha Cho, Hanju Kim, Junyoung Park, Hyeonmo Kim, Unil Yun
{"title":"Utility and occupancy driven pattern analysis for processing dynamic data streams in damped window control","authors":"Taewoong Ryu , Doyoung Kim , Seungwan Park, Seongbin Park, Myungha Cho, Hanju Kim, Junyoung Park, Hyeonmo Kim, Unil Yun","doi":"10.1016/j.knosys.2025.114453","DOIUrl":null,"url":null,"abstract":"<div><div>Data analysis is suitable for data control systems by discovering hidden knowledge that is difficult for humans to perceive from huge and complex data. In various data analysis methods, high utility occupancy pattern analysis considers the utility occupancy of each pattern in the corresponding transaction in addition to the profit and quantity of patterns, which is effective for data control systems, including data science fields. However, recent data holds more insightful knowledge when processing real-time generated data. Previous occupancy-based approaches do not handle the relative significance of the latest data. To overcome the limitation, we introduce a new method for discovering high utility occupancy patterns from dynamic data streams where time-sensitive data consistently occurs. The proposed method assigns relative importance to each pattern by considering the temporal aspect of each transaction. Advanced constructing and restructuring processes are utilized in the proposed method for efficiently controlling data according to the time flow of each pattern in dynamic environments. In the pattern expansion process, a new upper bound adopting the decaying factor is suggested to efficiently reduce unnecessary searches for unpromising patterns. Experimental results demonstrate that the proposed method has superior runtime and scalability performance compared to state-of-the-art methods with comparable memory usage. The ablation study underscores how the proposed components contribute to the overall effectiveness of the proposed method. Additional evaluations indicate that the proposed method analyzes insightful result patterns compared to state-of-the-art methods, and a case study demonstrates its applicability to real-time dynamic data control systems.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"329 ","pages":"Article 114453"},"PeriodicalIF":7.6000,"publicationDate":"2025-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705125014923","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Data analysis is suitable for data control systems by discovering hidden knowledge that is difficult for humans to perceive from huge and complex data. In various data analysis methods, high utility occupancy pattern analysis considers the utility occupancy of each pattern in the corresponding transaction in addition to the profit and quantity of patterns, which is effective for data control systems, including data science fields. However, recent data holds more insightful knowledge when processing real-time generated data. Previous occupancy-based approaches do not handle the relative significance of the latest data. To overcome the limitation, we introduce a new method for discovering high utility occupancy patterns from dynamic data streams where time-sensitive data consistently occurs. The proposed method assigns relative importance to each pattern by considering the temporal aspect of each transaction. Advanced constructing and restructuring processes are utilized in the proposed method for efficiently controlling data according to the time flow of each pattern in dynamic environments. In the pattern expansion process, a new upper bound adopting the decaying factor is suggested to efficiently reduce unnecessary searches for unpromising patterns. Experimental results demonstrate that the proposed method has superior runtime and scalability performance compared to state-of-the-art methods with comparable memory usage. The ablation study underscores how the proposed components contribute to the overall effectiveness of the proposed method. Additional evaluations indicate that the proposed method analyzes insightful result patterns compared to state-of-the-art methods, and a case study demonstrates its applicability to real-time dynamic data control systems.
期刊介绍:
Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.