{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:43:03Z","timestamp":1777696983783,"version":"3.51.4"},"reference-count":33,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2016,9,18]]},"DOI":"10.3233\/ida-160861","type":"journal-article","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T11:05:12Z","timestamp":1474369512000},"page":"1157-1180","source":"Crossref","is-referenced-by-count":32,"title":["Mining high utility itemsets based on the time decaying model"],"prefix":"10.1177","volume":"20","author":[{"given":"Donggyu","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-160861_ref1","unstructured":"Agrawal R. and Srikant R., Fast algorithms for mining association rules, 20th International Conference on Very Large Data Bases (1994), 487-499."},{"issue":"12","key":"10.3233\/IDA-160861_ref2","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","article-title":"Efficient tree structures for high utility pattern mining in incremental databases","volume":"21","author":"Ahmed","year":"2009","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"15","key":"10.3233\/IDA-160861_ref3","doi-asserted-by":"crossref","first-page":"11979","DOI":"10.1016\/j.eswa.2012.03.062","article-title":"Interactive mining of high utility patterns over data streams","volume":"39","author":"Ahmed","year":"2012","journal-title":"Expert Systems with Applications (ESWA)"},{"key":"10.3233\/IDA-160861_ref4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.ins.2014.08.073","article-title":"Scalable out-of-core itemset mining","volume":"293","author":"Baralis","year":"2015","journal-title":"Information Sciences (ISCI)"},{"issue":"8","key":"10.3233\/IDA-160861_ref5","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.is.2005.04.001","article-title":"Finding recently frequent itemsets adaptively over online transaction data streams","volume":"31","author":"Chang","year":"2006","journal-title":"Information Systems"},{"key":"10.3233\/IDA-160861_ref6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ins.2012.05.007","article-title":"Mining frequent patterns in a varying-size sliding window of online transactional data streams","volume":"215","author":"Chen","year":"2012","journal-title":"Information Sciences (ISCI)"},{"key":"10.3233\/IDA-160861_ref7","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ins.2013.09.007","article-title":"Mining frequent items in data stream using time fading model","volume":"257","author":"Chen","year":"2014","journal-title":"Information Sciences (ISCI)"},{"issue":"7","key":"10.3233\/IDA-160861_ref8","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1016\/j.jss.2007.07.026","article-title":"An efficient algorithm for mining temporal high utility itemsets from data streams","volume":"81","author":"Chu","year":"2008","journal-title":"Journal of Systems and Software"},{"issue":"1","key":"10.3233\/IDA-160861_ref9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/S0097539799361701","article-title":"An approximate l1-difference algorithm for massive data streams","volume":"32","author":"Feigenbaum","year":"1999","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10.3233\/IDA-160861_ref10","doi-asserted-by":"crossref","first-page":"585","DOI":"10.3233\/IDA-130595","article-title":"UT-Tree: Efficient mining of high utility itemsets from data streams","volume":"17","author":"Feng","year":"2013","journal-title":"Intelligent Data Analysis"},{"issue":"10","key":"10.3233\/IDA-160861_ref11","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","article-title":"Fast algorithms for frequent itemset mining using fp-trees","volume":"17","author":"Grahne","year":"2005","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"10.3233\/IDA-160861_ref12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"2","key":"10.3233\/IDA-160861_ref13","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.eswa.2013.07.094","article-title":"Sliding window based weighted maximal frequent pattern mining over data streams","volume":"41","author":"Lee","year":"2014","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"10.3233\/IDA-160861_ref14","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1177\/0165551511416436","article-title":"MHUI-max: An efficient algorithm for discovering high-utility itemsets from data streams","volume":"37","author":"Li","year":"2011","journal-title":"Journal of Information Science"},{"key":"10.3233\/IDA-160861_ref15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.knosys.2013.12.001","article-title":"Efficient frequent itemset mining method over time-sensitive streams","volume":"56","author":"Li","year":"2014","journal-title":"Knowledge-Based Systems (KBS)"},{"issue":"10","key":"10.3233\/IDA-160861_ref16","doi-asserted-by":"crossref","first-page":"13386","DOI":"10.1016\/j.eswa.2011.04.167","article-title":"An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams","volume":"38","author":"Li","year":"2011","journal-title":"Expert Systems with Applications (ESWA)"},{"issue":"1","key":"10.3233\/IDA-160861_ref17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/IDA-140695","article-title":"Mining high utility itemsets for transaction deletion in a dynamic database","volume":"19","author":"Lin","year":"2015","journal-title":"Intelligence Data Analysis"},{"issue":"6","key":"10.3233\/IDA-160861_ref18","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.camwa.2008.10.060","article-title":"Mining frequent closed itemsets from a landmark window over online data streams","volume":"57","author":"Liu","year":"2009","journal-title":"Computers and Mathematics with Applications"},{"issue":"1","key":"10.3233\/IDA-160861_ref19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","article-title":"DSM-FI: An efficient algorithm for mining frequent itemsets in data streams","volume":"17","author":"Li","year":"2008","journal-title":"Knowledge and Information Systems (KAIS)"},{"key":"10.3233\/IDA-160861_ref20","first-page":"689","article-title":"A two-phase algorithm for fast discovery of high utility itemsets","volume":"3518","author":"Liu","year":"2005","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"10.3233\/IDA-160861_ref21","doi-asserted-by":"crossref","unstructured":"Liu M. and Qu J., Mining high utility itemsets without candidate generation, Proceedings of the 21St ACM international conference on Information and knowledge management (CIKM) (2012), 55-64.","DOI":"10.1145\/2396761.2396773"},{"key":"10.3233\/IDA-160861_ref22","doi-asserted-by":"crossref","unstructured":"Manku G.S. and Motwani R., Approximate frequency counts over data streams, Proc of the VLDB Endowment 5(12) (2012), 1699.","DOI":"10.14778\/2367502.2367508"},{"key":"10.3233\/IDA-160861_ref23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.knosys.2013.10.013","article-title":"Efficient frequent pattern mining based on linear prefix tree","volume":"55","author":"Pyun","year":"2014","journal-title":"Knowledge-based Systems (KBS)"},{"issue":"6","key":"10.3233\/IDA-160861_ref26","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.3233\/IDA-140683","article-title":"Discovering high utility itemsets with multiple minimum supports","volume":"18","author":"Ryang","year":"2014","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-160861_ref27","doi-asserted-by":"crossref","first-page":"12947","DOI":"10.1016\/j.eswa.2012.05.035","article-title":"Efficient algorithms for mining maximal high utility itemsets from data streams with different models","volume":"39","author":"Shie","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-160861_ref28","doi-asserted-by":"crossref","first-page":"3843","DOI":"10.1016\/j.ins.2009.07.012","article-title":"Sliding window-based frequent pattern mining over data streams","volume":"179","author":"Tanbeer","year":"2009","journal-title":"Information Sciences (ISCI)"},{"issue":"8","key":"10.3233\/IDA-160861_ref29","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":"3","key":"10.3233\/IDA-160861_ref30","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","article-title":"Efficient algorithm for mining the concise and lossless representation of high utility itemsets","volume":"27","author":"Tseng","year":"2015","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-160861_ref31","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.knosys.2013.10.011","article-title":"Mining maximal frequent patterns by considering weight conditions over data streams","volume":"55","author":"Yun","year":"2014","journal-title":"Knowledge-based Systems (KBS)"},{"issue":"2","key":"10.3233\/IDA-160861_ref32","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10489-014-0601-6","article-title":"Incremental high utility pattern mining with static and dynamic databases","volume":"42","author":"Yun","year":"2014","journal-title":"Applied Intelligence"},{"key":"10.3233\/IDA-160861_ref33","doi-asserted-by":"crossref","first-page":"1986","DOI":"10.1016\/j.ins.2005.11.003","article-title":"A false negative approach to mining frequent itemsets from high speed transactional data streams","volume":"176","author":"Yu","year":"2006","journal-title":"Information Sciences (ISCI)"},{"key":"10.3233\/IDA-160861_ref34","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 Science (ISCI)"},{"key":"10.3233\/IDA-160861_ref35","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.knosys.2015.04.004","article-title":"Mining summarization of high utility itemsets","volume":"84","author":"Zhang","year":"2015","journal-title":"Knowledge-Based Systems"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-160861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:21:30Z","timestamp":1777454490000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-160861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,18]]},"references-count":33,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/ida-160861","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,18]]}}}