{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T00:27:35Z","timestamp":1777854455922,"version":"3.51.4"},"reference-count":31,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2011,9,13]],"date-time":"2011-09-13T00:00:00Z","timestamp":1315872000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Science"],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>Online mining of utility itemsets from data streams is one of the most interesting research issues in stream data mining. Although a number of relevant approaches have been proposed in recent years, they have the drawback of producing a large number of candidate itemsets for high-utility itemset mining. In this paper, an efficient algorithm, called MHUI-max (Mining High-Utility Itemsets based on LexTree-maxHTU), is proposed for mining high-utility itemsets from data streams with fewer candidates. Based on the framework of the MHUI-max algorithm, an effective representation of item information, called TID-list, and a new lexicographical tree-based data structure, called LexTree-maxHTU, has been developed to improve the efficiency of discovering high-utility itemsets with positive profits from data streams. Experimental results show that the proposed algorithm, MHUI-max, outperforms the existing approaches, MHUI-TID and THUI-Mine, for mining high-utility itemsets from data streams over transaction-sensitive sliding windows.<\/jats:p>","DOI":"10.1177\/0165551511416436","type":"journal-article","created":{"date-parts":[[2011,9,14]],"date-time":"2011-09-14T00:48:58Z","timestamp":1315961338000},"page":"532-545","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":10,"title":["MHUI-max: An efficient algorithm for discovering high-utility itemsets from data streams"],"prefix":"10.1177","volume":"37","author":[{"given":"Hua-Fu","family":"Li","sequence":"first","affiliation":[{"name":"Department of Information Management, Kainan University, Taiwan"}]}],"member":"179","published-online":{"date-parts":[[2011,9,13]]},"reference":[{"key":"bibr1-0165551511416436","first-page":"207","volume-title":"Proc. of ACM SIGMOD Intel. Conf. on Management of Data","author":"Agrawal R"},{"key":"bibr2-0165551511416436","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Agrawal R","year":"1996"},{"key":"bibr3-0165551511416436","first-page":"487","volume-title":"Proc. of the 20th Intel. Conf. on Very Large Databases (VLDB)","author":"Agrawal R","year":"1994"},{"key":"bibr4-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"bibr5-0165551511416436","first-page":"263","volume-title":"Proc. of the ACM 10th Intel. Conf. on Information and Knowledge Management (CIKM)","author":"Lee C-H"},{"key":"bibr6-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1109\/69.634757"},{"key":"bibr7-0165551511416436","first-page":"432","volume-title":"Proc. of the 21th Intel. Conf. on Very Large Databases (VLDB)","author":"Savasere A"},{"key":"bibr8-0165551511416436","volume-title":"Proc. of the 3rd IEEE Intel. Conf. on Data Mining (ICDM)","author":"Chan R"},{"key":"bibr9-0165551511416436","volume-title":"Proc. of the ACM Intel. Conf. on Utility-Based Data Mining Workshop (UBDM)","author":"Liu Y"},{"key":"bibr10-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1145\/776985.776986"},{"key":"bibr11-0165551511416436","first-page":"487","volume-title":"Proc. of Intel. Conf. on Knowledge Discovery and Data Mining (SIGKDD)","author":"Chang J-H"},{"issue":"4","key":"bibr12-0165551511416436","first-page":"753","volume":"20","author":"Chang J-H","year":"2004","journal-title":"Journal of Information Science and Engineering"},{"key":"bibr13-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1177\/0165551505055405"},{"key":"bibr14-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1177\/0165551505055405"},{"key":"bibr15-0165551511416436","first-page":"59","volume-title":"Proc. IEEE Intel. Conf. on Data Mining (ICDM)","author":"Chi Y"},{"key":"bibr16-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1177\/016555150000000"},{"key":"bibr17-0165551511416436","first-page":"287","volume-title":"Proc. of the ACM 12th Intel. Conf. on Information and Knowledge Management (CIKM)","author":"Jin C"},{"key":"bibr18-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0112-4"},{"key":"bibr19-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.11.061"},{"key":"bibr20-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.12.054"},{"key":"bibr21-0165551511416436","first-page":"346","volume-title":"Proc. of the 28th Intel. Conf. on Very Large Databases (VLDB)","author":"Manku G"},{"key":"bibr22-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-009-0269-0"},{"key":"bibr23-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-009-0211-5"},{"key":"bibr24-0165551511416436","first-page":"358","volume-title":"Proc. of the 28th Intel. Conf. on Very Large Databases (VLDB)","author":"Zhu Y"},{"key":"bibr25-0165551511416436","volume-title":"Proc. of 4th SIAM Intel. Conf. on Data Mining (SDM)","author":"Yao H"},{"key":"bibr26-0165551511416436","first-page":"28","volume-title":"Proc. of the ACM Intel. Conf. on Utility-Based Data Mining Workshop (UBDM)","author":"Yao H"},{"key":"bibr27-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.009"},{"key":"bibr28-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.05.066"},{"key":"bibr29-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2007.07.026"},{"key":"bibr30-0165551511416436","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0330-z"},{"key":"bibr31-0165551511416436","first-page":"22","volume-title":"Proc. of the 25th Annual ACM Symposium on Applied Computing (ACM SAC)","author":"Shie B-E"}],"container-title":["Journal of Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0165551511416436","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0165551511416436","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0165551511416436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T23:08:08Z","timestamp":1777504088000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0165551511416436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,13]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1177\/0165551511416436"],"URL":"https:\/\/doi.org\/10.1177\/0165551511416436","relation":{},"ISSN":["0165-5515","1741-6485"],"issn-type":[{"value":"0165-5515","type":"print"},{"value":"1741-6485","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,13]]}}}