{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T02:53:55Z","timestamp":1776394435358,"version":"3.51.2"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"crossref","award":["MOST 104-2918-I-009-003, MOST 105-2221-E-009-160, MOST 105-2218-E-009-011, MOST 106-3114-E-009-011 and MOST 106-2221-E-009-152-MY3"],"award-info":[{"award-number":["MOST 104-2918-I-009-003, MOST 105-2221-E-009-160, MOST 105-2218-E-009-011, MOST 106-3114-E-009-011 and MOST 106-2221-E-009-152-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2018,9,30]]},"abstract":"<jats:p>\n            High utility sequential pattern (HUSP) mining is an emerging topic in pattern mining, and only a few algorithms have been proposed to address it. In practice, most sequence databases usually grow over time, and it is inefficient for existing algorithms to mine HUSPs from scratch when databases grow with a small portion of updates. In view of this, we propose the IncUSP-Miner\n            <jats:sup>+<\/jats:sup>\n            algorithm to mine HUSPs incrementally. Specifically, to avoid redundant re-computations, we propose a tighter upper bound of the utility of a sequence, called Tight Sequence Utility (TSU), and then we design a novel data structure, called the candidate pattern tree, to buffer the sequences whose TSU values are greater than or equal to the minimum utility threshold in the original database. Accordingly, to avoid keeping a huge amount of utility information for each sequence, a set of concise utility information is designed to be stored in each tree node. To improve the mining efficiency, several strategies are proposed to reduce the amount of computation for utility update and the scopes of database scans. Moreover, several strategies are also proposed to properly adjust the candidate pattern tree for the support of multiple database updates. Experimental results on some real and synthetic datasets show that IncUSP-Miner\n            <jats:sup>+<\/jats:sup>\n            is able to efficiently mine HUSPs incrementally.\n          <\/jats:p>","DOI":"10.1145\/3178114","type":"journal-article","created":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T13:41:34Z","timestamp":1528119694000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["On Incremental High Utility Sequential Pattern Mining"],"prefix":"10.1145","volume":"9","author":[{"given":"Jun-Zhe","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science, College of Computer Science, National Chiao Tung University, Hsinchu City, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9471-7672","authenticated-orcid":false,"given":"Jiun-Long","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, College of Computer Science, National Chiao Tung University, Hsinchu City, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4218\/etrij.10.1510.0066"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4103\/0256-4602.74506"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775109"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 11th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining.","author":"Chen Y."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014114"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases. 223--234","author":"Garofalakis M. N."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2006.12.562"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.02.022"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_52"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/319950.320010"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.77"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 16th International Conference on Database Systems for Advanced Applications. 224--238","author":"Shie B.-E."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology. 3--17","author":"Srikant R."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 20th IEEE International Conference on Data Engineering. 79--90","author":"Wang J."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983691"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0914-8"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 3rd SIAM International Conference on Data Mining. 166--177","author":"Yan X."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 13rd IEEE International Conference on Data Mining. 1259--1264","author":"Yin J."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3178114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:02:55Z","timestamp":1750215775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9,30]]}},"alternative-id":["10.1145\/3178114"],"URL":"https:\/\/doi.org\/10.1145\/3178114","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6]]},"assertion":[{"value":"2017-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}