{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:59:52Z","timestamp":1777705192612,"version":"3.51.4"},"reference-count":15,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,9,15]]},"abstract":"<jats:p>The researcher proposed the concept of Top-K high-utility itemsets mining over data streams. Users directly specify the number K of high-utility itemsets they wish to obtain for mining with no need to set a minimum utility threshold. There exist some problems in current Top-K high-utility itemsets mining algorithms over data streams including the complex construction process of the storage structure, the inefficiency of threshold raising strategies and utility pruning strategies, and large scale of the search space, etc., which still can not meet the requirement of real-time processing over data streams with limited time and memory constraints. To solve this problem, this paper proposes an efficient algorithm based on dataset projection for mining Top-K high-utility itemsets from a data stream. A data structure CIUDataListSW is also proposed, which stores the position of the item in the transaction to effectively obtain the initial projected dataset of the item. In order to improve the projection efficiency, this paper innovates a new reorganization technology for projected transactions in common batches to maintain the sort order of transactions in the process of dataset projection. Dual pruning strategy and transaction merging mechanism are also used to further reduce search space and dataset scanning costs. In addition, based on the proposed CUDHSW structure, an efficient threshold raising strategy CUD is used, and a new threshold raising strategy CUDCB is designed to further shorten the mining time. Experimental results show that the algorithm has great advantages in running time and memory consumption, and it is especially suitable for the mining of high-utility itemsets of dense datasets.<\/jats:p>","DOI":"10.3233\/jifs-210610","type":"journal-article","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T14:32:16Z","timestamp":1628605936000},"page":"3317-3338","source":"Crossref","is-referenced-by-count":8,"title":["ETKDS: An efficient algorithm of Top-K high utility itemsets mining over data streams under sliding window model"],"prefix":"10.1177","volume":"41","author":[{"given":"Haodong","family":"Cheng","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, North Minzu University, Yinchuan, China"}]},{"given":"Meng","family":"Han","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, North Minzu University, Yinchuan, China"}]},{"given":"Ni","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, North Minzu University, Yinchuan, China"}]},{"given":"Le","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, North Minzu University, Yinchuan, China"}]},{"given":"Xiaojuan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, North Minzu University, Yinchuan, China"}]}],"member":"179","reference":[{"issue":"8","key":"10.3233\/JIFS-210610_ref3","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","article-title":"Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases","volume":"25","author":"Tseng","year":"2013","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"8","key":"10.3233\/JIFS-210610_ref4","doi-asserted-by":"crossref","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","article-title":"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates","volume":"41","author":"Yun","year":"2014","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"10.3233\/JIFS-210610_ref7","doi-asserted-by":"crossref","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","article-title":"Pruning strategies for mining high utility itemsets","volume":"42","author":"Krishnamoorthy","year":"2015","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-210610_ref8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.future.2018.12.029","article-title":"Efficient approach for incremental high utility pattern mining with indexed list structure","volume":"95","author":"Yun","year":"2019","journal-title":"Future Generation Computer Systems"},{"key":"10.3233\/JIFS-210610_ref9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","article-title":"Efficient list based mining of high average utility patterns with maximum average pruning strategies","volume":"543","author":"Kim","year":"2021","journal-title":"Information Sciences"},{"issue":"5","key":"10.3233\/JIFS-210610_ref10","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","article-title":"Mining High Utility Patterns in One Phase without Generating Candidates","volume":"28","author":"Liu","year":"2016","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/JIFS-210610_ref12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10115-018-1207-9","article-title":"DMHUPS: Discovering Multiple High Utility Patterns Simultaneously","volume":"59","author":"Prasad","year":"2019","journal-title":"Knowledge and Information Systems"},{"issue":"3","key":"10.3233\/JIFS-210610_ref13","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1007\/s10489-018-1316-x","article-title":"TKEH: an efficient algorithm for mining top-k high utility itemsets","volume":"49","author":"Singh","year":"2019","journal-title":"Applied Intelligence"},{"issue":"11","key":"10.3233\/JIFS-210610_ref14","doi-asserted-by":"crossref","first-page":"4141","DOI":"10.1007\/s10115-020-01485-w","article-title":"An efficient projection-based method for high utility itemset mining using a novel pruning approach on the utility matrix","volume":"62","author":"Sohrabi","year":"2020","journal-title":"Knowledge and Information Systems"},{"issue":"1","key":"10.3233\/JIFS-210610_ref15","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ins.2014.01.045","article-title":"Mining top-k high utility patterns over data streams","volume":"285","author":"Zihayat","year":"2014","journal-title":"Information Sciences"},{"issue":"12","key":"10.3233\/JIFS-210610_ref16","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1007\/s10489-017-0939-7","article-title":"Mining Top-K high-utility itemsets from a data stream under sliding window model","volume":"47","author":"Dawar","year":"2017","journal-title":"Applied Intelligence"},{"key":"10.3233\/JIFS-210610_ref17","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.eswa.2016.03.001","article-title":"High utility pattern mining over data streams with sliding window technique","volume":"57","author":"Ryang","year":"2016","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.3233\/JIFS-210610_ref19","doi-asserted-by":"crossref","first-page":"342","DOI":"10.2991\/ijcis.2019.125905650","article-title":"A New Algorithm of Mining High Utility Sequential Pattern in Streaming Data","volume":"12","author":"Tang","year":"2018","journal-title":"International Journal of Computational Intelligence Systems"},{"key":"10.3233\/JIFS-210610_ref21","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","article-title":"An efficient algorithm for mining the top-k high utility itemsets using novel threshold raising and pruning strategies","volume":"104","author":"Duong","year":"2016","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/JIFS-210610_ref22","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.eswa.2018.09.051","article-title":"Mining top-k high utility itemsets with effective threshold raising strategies","volume":"117","author":"Krishnamoorthy","year":"2019","journal-title":"Expert Systems with Applications"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:10Z","timestamp":1777455790000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,15]]},"references-count":15,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210610","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,15]]}}}