{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:45:29Z","timestamp":1765039529316,"version":"3.41.0"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,6,26]],"date-time":"2020-06-26T00:00:00Z","timestamp":1593129600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Shenzhen Technical Grant","award":["KQJSCX 20170726103424709,JCYJ 20170307151733005,"],"award-info":[{"award-number":["KQJSCX 20170726103424709,JCYJ 20170307151733005,"]}]},{"name":"NSF","award":["III-1526499, III-1763325, III-1909323, CNS-1930941."],"award-info":[{"award-number":["III-1526499, III-1763325, III-1909323, CNS-1930941."]}]},{"name":"Norway University of Applied Sciences"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2020,9,30]]},"abstract":"<jats:p>Useful knowledge, embedded in a database, is likely to change over time. Identifying the recent changes in temporal data can provide valuable up-to-date information to decision makers. Nevertheless, techniques for mining high-utility patterns (HUPs) seldom consider recency as a criterion to discover patterns. Thus, the traditional utility mining framework is inadequate for obtaining up-to-date insights about real-world data. In this article, we address this issue by introducing a novel framework, named utility-driven mining of recent\/trend high-utility patterns (RUPs), in temporal databases for intelligent systems, based on user-specified minimum recency and minimum utility thresholds. The utility-driven RUP algorithm is based on novel global and conditional downward closure properties, and a recency-utility tree. Moreover, it adopts a vertical compact recency-utility list structure to store the information required by the mining process. The developed RUP algorithm recursively discovers recent high-utility patterns. It is also fast and consumes a small amount of memory due to its pattern discovery approach that does not generate candidates. Two improved versions of the algorithm with additional pruning strategies are also designed to speed up the discovery of patterns by reducing the search space. Results of a substantial experimental evaluation show that the proposed algorithm can efficiently identify all recent HUPs in large-scale databases, and that the improved algorithm performs best.<\/jats:p>","DOI":"10.1145\/3391251","type":"journal-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T11:45:47Z","timestamp":1593431147000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Utility-Driven Mining of Trend Information for Intelligent System"],"prefix":"10.1145","volume":"11","author":[{"given":"Wensheng","family":"Gan","sequence":"first","affiliation":[{"name":"Jinan University, Guangzhou, Guangdong Province, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[{"name":"Western Norway University of Applied Sciences, Inndalsveien, Bergen, Norway"}]},{"given":"Han-Chieh","family":"Chao","sequence":"additional","affiliation":[{"name":"National Dong Hwa University, Hualien County, Taiwan"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen), Shenzhen, China"}]},{"given":"Xuan","family":"Wang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen), Shenzhen, China"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, Chicago, IL, United States"}]}],"member":"320","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.250074"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"volume-title":"Quest Synthetic Data Generator","year":"1994","author":"Agrawal Rakesh","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339578"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956807"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.553155"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367917"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-1020-2"},{"volume-title":"n.d. Example Database Foodmart of Microsoft Analysis Services. Retrieved","year":"2020","key":"e_1_2_1_11_1"},{"volume-title":"Proceedings of the International Symposium on Methodologies for Intelligent Systems. 83--92","author":"Fournier-Viger Philippe","key":"e_1_2_1_12_1"},{"volume-title":"Proceedings of the IEEE International Conference on Big Data. IEEE","author":"Gan Wensheng","key":"e_1_2_1_13_1"},{"volume-title":"Proceedings of the IEEE International Conference on Big Data. IEEE","author":"Gan Wensheng","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1216"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.12.003"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1242"},{"key":"e_1_2_1_18_1","first-page":"2019","article-title":"A survey of utility-oriented pattern mining. IEEE Transactions on Knowledge and Data Engineering","volume":"20","author":"Gan Wensheng","year":"2019","journal-title":"Early Access"},{"volume-title":"Philippe Fournier-Viger, Han-Chieh Chao, and Philip S. Yu.","year":"2019","author":"Gan Wensheng","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2896267"},{"volume-title":"Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics. IEEE","author":"Gan Wensheng","key":"e_1_2_1_21_1"},{"key":"e_1_2_1_22_1","first-page":"1","article-title":"Fast utility mining on sequence data","volume":"99","author":"Gan Wensheng","year":"2020","journal-title":"IEEE Transactions on Cybernetics PP"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.01.006"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.02.029"},{"key":"e_1_2_1_26_1","unstructured":"Frequent Itemset Mining Dataset Repository. 2012. Home Page. Retrieved June 3 2020 from http:\/\/fimi.ua.ac.be\/data\/.  Frequent Itemset Mining Dataset Repository. 2012. Home Page. Retrieved June 3 2020 from http:\/\/fimi.ua.ac.be\/data\/."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.11.001"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.08.028"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.12.035"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.11.040"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.11.021"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/3184222.3184226"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.08.022"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.06.009"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0991-3"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.019"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2016.02.003"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2015.05.003"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2015.06.002"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.02.022"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_79"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.02.058"},{"volume-title":"Proceeding of the 3rd International Conference on Principles of Knowledge Representation and Reasoning. 539--550","year":"1992","author":"Rymon Ron","key":"e_1_2_1_44_1"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833478"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2458860"},{"volume-title":"Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM","author":"Tseng Vincent S.","key":"e_1_2_1_48_1"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0914-8"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2820740"},{"volume-title":"Butz","year":"2004","author":"Yao Hong","key":"e_1_2_1_51_1"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.12.029"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.03.016"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0986-0"}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3391251","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3391251","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3391251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:37Z","timestamp":1750199917000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3391251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,26]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9,30]]}},"alternative-id":["10.1145\/3391251"],"URL":"https:\/\/doi.org\/10.1145\/3391251","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"type":"print","value":"2158-656X"},{"type":"electronic","value":"2158-6578"}],"subject":[],"published":{"date-parts":[[2020,6,26]]},"assertion":[{"value":"2019-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}