{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:44:06Z","timestamp":1762299846573,"version":"3.41.0"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62002136"],"award-info":[{"award-number":["62002136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Guangdong Province, China","award":["2020A1515010970"],"award-info":[{"award-number":["2020A1515010970"]}]},{"name":"Shenzhen Research Council","award":["GJHZ20180928155209705"],"award-info":[{"award-number":["GJHZ20180928155209705"]}]},{"name":"NSF Grants","award":["III-1763325, III-1909323, and SaTC-1930941"],"award-info":[{"award-number":["III-1763325, III-1909323, and SaTC-1930941"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2022,4,30]]},"abstract":"<jats:p>\n            Utility mining has emerged as an important and interesting topic owing to its wide application and considerable popularity. However, conventional utility mining methods have a bias toward items that have longer on-shelf time as they have a greater chance to generate a high utility. To eliminate the bias, the problem of on-shelf utility mining (OSUM) is introduced. In this article, we focus on the task of OSUM of sequence data, where the sequential database is divided into several partitions according to time periods and items are associated with utilities and several on-shelf time periods. To address the problem, we propose two methods, OSUM of sequence data (OSUMS) and OSUMS\n            <jats:sup>+<\/jats:sup>\n            , to extract on-shelf high-utility sequential patterns. For further efficiency, we also design several strategies to reduce the search space and avoid redundant calculation with two upper bounds time prefix extension utility (\n            <jats:italic>TPEU<\/jats:italic>\n            ) and time reduced sequence utility (\n            <jats:italic>TRSU<\/jats:italic>\n            ). In addition, two novel data structures are developed for facilitating the calculation of upper bounds and utilities. Substantial experimental results on certain real and synthetic datasets show that the two methods outperform the state-of-the-art algorithm. In conclusion, OSUMS may consume a large amount of memory and is unsuitable for cases with limited memory, while OSUMS\n            <jats:sup>+<\/jats:sup>\n            has wider real-life applications owing to its high efficiency.\n          <\/jats:p>","DOI":"10.1145\/3457570","type":"journal-article","created":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T21:25:55Z","timestamp":1626902755000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["On-Shelf Utility Mining of Sequence Data"],"prefix":"10.1145","volume":"16","author":[{"given":"Chunkai","family":"Zhang","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zilin","family":"Du","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuting","family":"Yang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wensheng","family":"Gan","sequence":"additional","affiliation":[{"name":"Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655281"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SNPD.2010.21"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4218\/etrij.10.1510.0066"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2420557"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775109"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the IEEE International Conference on Big Data. IEEE, 5340\u20135349","author":"Chen Jiahui","year":"2020","unstructured":"Jiahui Chen , Xu Guo , Wensheng Gan , Chien-Ming Chen , Weiping Ding , and Guoting Chen . 2020 . OSUMI: On-shelf utility mining from itemset-based data . In Proceedings of the IEEE International Conference on Big Data. IEEE, 5340\u20135349 . Jiahui Chen, Xu Guo, Wensheng Gan, Chien-Ming Chen, Weiping Ding, and Guoting Chen. 2020. OSUMI: On-shelf utility mining from itemset-based data. In Proceedings of the IEEE International Conference on Big Data. IEEE, 5340\u20135349."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-1020-2"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54472-4_51"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41561-1_6"},{"key":"e_1_2_1_13_1","first-page":"54","article-title":"A survey of sequential pattern mining","volume":"1","author":"Fournier-Viger Philippe","year":"2017","unstructured":"Philippe Fournier-Viger , Jerry Chun-Wei Lin , Rage Uday Kiran , Yun Sing Koh , and Rincy Thomas . 2017 . A survey of sequential pattern mining . Data Science and Pattern Recognition 1 , 1 (2017), 54 \u2013 77 . Philippe Fournier-Viger, Jerry Chun-Wei Lin, Rage Uday Kiran, Yun Sing Koh, and Rincy Thomas. 2017. A survey of sequential pattern mining. Data Science and Pattern Recognition 1, 1 (2017), 54\u201377.","journal-title":"Data Science and Pattern Recognition"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1207"},{"key":"e_1_2_1_15_1","volume-title":"Tseng","author":"Fournier-Viger Philippe","year":"2014","unstructured":"Philippe Fournier-Viger , Cheng-Wei Wu , Souleymane Zida , and Vincent S . Tseng . 2014 . FHM : Faster high-utility itemset mining using estimated utility co-occurrence pruning. In Proceedings of the International Symposium on Methodologies for Intelligent Systems. Springer , 83\u201392. Philippe Fournier-Viger, Cheng-Wei Wu, Souleymane Zida, and Vincent S. Tseng. 2014. FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In Proceedings of the International Symposium on Methodologies for Intelligent Systems. Springer, 83\u201392."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.070"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695823"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2942594"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2020.2979279"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43946-4_1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1242"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.10.033"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2970176"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3446938"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132960.1132963"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 31st Workshop on Combinatorial Mathematics and Computation Theory. 250\u2013255","author":"Lan Guo-Cheng","year":"2014","unstructured":"Guo-Cheng Lan , Tzung-Pei Hong , Jen-Peng Huang , and I- Wei Lin . 2014 . Discovery of high utility sequential patterns with consideration of on-shelf time periods of products . In Proceedings of the 31st Workshop on Combinatorial Mathematics and Computation Theory. 250\u2013255 . Guo-Cheng Lan, Tzung-Pei Hong, Jen-Peng Huang, and I-Wei Lin. 2014. Discovery of high utility sequential patterns with consideration of on-shelf time periods of products. In Proceedings of the 31st Workshop on Combinatorial Mathematics and Computation Theory. 250\u2013255."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.10.049"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.11.040"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.019"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2159-1"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2015.06.002"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_79"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57529-2_16"},{"key":"e_1_2_1_34_1","first-page":"27","article-title":"Mining high on-shelf utility itemsets with negative values from dynamic updated database","volume":"4","author":"Radkar Anjali N.","year":"2015","unstructured":"Anjali N. Radkar and S. S. Pawar . 2015 . Mining high on-shelf utility itemsets with negative values from dynamic updated database . International Journal of Advanced Studies in Computers, Science and Engineering 4 , 6 (2015), 27 . Anjali N. Radkar and S. S. Pawar. 2015. Mining high on-shelf utility itemsets with negative values from dynamic updated database. International Journal of Advanced Studies in Computers, Science and Engineering 4, 6 (2015), 27.","journal-title":"International Journal of Advanced Studies in Computers, Science and Engineering"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1997305.1997329"},{"volume-title":"High-Utility Pattern Mining","author":"Truong-Chi Tin","key":"e_1_2_1_36_1","unstructured":"Tin Truong-Chi and Philippe Fournier-Viger . 2019. A survey of high utility sequential pattern mining . In High-Utility Pattern Mining . Springer , 97\u2013129. Tin Truong-Chi and Philippe Fournier-Viger. 2019. A survey of high utility sequential pattern mining. In High-Utility Pattern Mining. Springer, 97\u2013129."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0914-8"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2018.03.001"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.148"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.11.038"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908452"},{"key":"e_1_2_1_44_1","volume-title":"Cheng-Wei Wu, and Vincent S. Tseng.","author":"Zida Souleymane","year":"2015","unstructured":"Souleymane Zida , Philippe Fournier-Viger , Jerry Chun-Wei Lin , Cheng-Wei Wu, and Vincent S. Tseng. 2015 . EFIM : A highly efficient algorithm for high-utility itemset mining. In Proceedings of the Mexican International Conference on Artificial Intelligence. Springer , 530\u2013546. Souleymane Zida, Philippe Fournier-Viger, Jerry Chun-Wei Lin, Cheng-Wei Wu, and Vincent S. Tseng. 2015. EFIM: A highly efficient algorithm for high-utility itemset mining. In Proceedings of the Mexican International Conference on Artificial Intelligence. Springer, 530\u2013546."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12918-017-0475-4"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457570","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3457570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:07Z","timestamp":1750195687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4,30]]}},"alternative-id":["10.1145\/3457570"],"URL":"https:\/\/doi.org\/10.1145\/3457570","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2020-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}