{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:27:38Z","timestamp":1775021258873,"version":"3.50.1"},"reference-count":41,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61806105"],"award-info":[{"award-number":["61806105"]}]},{"name":"National Natural Science Foundation of China","award":["62076143"],"award-info":[{"award-number":["62076143"]}]},{"name":"National Natural Science Foundation of China","award":["61906104"],"award-info":[{"award-number":["61906104"]}]},{"name":"National Natural Science Foundation of China","award":["ZR2019BF018"],"award-info":[{"award-number":["ZR2019BF018"]}]},{"name":"National Natural Science Foundation of China","award":["ZR2021QF059"],"award-info":[{"award-number":["ZR2021QF059"]}]},{"name":"Natural Science Foundation of the Shandong Province","award":["61806105"],"award-info":[{"award-number":["61806105"]}]},{"name":"Natural Science Foundation of the Shandong Province","award":["62076143"],"award-info":[{"award-number":["62076143"]}]},{"name":"Natural Science Foundation of the Shandong Province","award":["61906104"],"award-info":[{"award-number":["61906104"]}]},{"name":"Natural Science Foundation of the Shandong Province","award":["ZR2019BF018"],"award-info":[{"award-number":["ZR2019BF018"]}]},{"name":"Natural Science Foundation of the Shandong Province","award":["ZR2021QF059"],"award-info":[{"award-number":["ZR2021QF059"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Periodic high-utility sequential pattern mining (PHUSPM) is used to extract periodically occurring high-utility sequential patterns (HUSPs) from a quantitative sequence database according to a user-specified minimum utility threshold (minutil). A sequential pattern\u2019s periodicity is determined by measuring when the frequency of its periods (the time between two consecutive happenings of the sequential pattern) exceed a user-specified maximum periodicity threshold (maxPer). However, due to the strict judgment threshold, the traditional PHUSPM method has the problem that some useful sequential patterns are discarded and the periodic values of some sequential patterns fluctuate greatly (i.e., are unstable). In frequent itemset mining (FIM), some researchers put forward some strategies to solve these problems. Because of the symmetry of frequent itemset pattern (FIPs), these strategies cannot be directly applied to PHUSPM. In order to address these issues, this work proposes the stable periodic high-utility sequential pattern mining (SPHUSPM) algorithm. The contributions made by this paper are as follows. First, we introduce the concept of stability to overcome the abovementioned problems, mine sequential patterns with stable periodic behavior, and propose the concept of stable periodic high-utility sequential patterns (SPHUSPs) for the first time. Secondly, we design a new data structure named the PUL-list to record the periodic information of sequential patterns, thereby improving the mining efficiency. Thirdly, we propose the maximum lability pruning strategy in sequential pattern (MLPS), which can prune a large number of unstable sequential patterns in advance. To assess the algorithm\u2019s effectiveness, we perform many experiments. It turns out that the algorithm can not only mine patterns that are ignored by traditional algorithms, but also ensure that the discovered patterns have stable periodic behavior. In addition, after using the MLPS pruning strategy, the algorithm can prune 46.5% of candidates in advance on average in six datasets. Pruning a large number of candidates in advance not only speeds up the mining process, but also greatly reduces memory usage.<\/jats:p>","DOI":"10.3390\/sym14102032","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T01:23:16Z","timestamp":1664414596000},"page":"2032","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Efficient Algorithm for Mining Stable Periodic High-Utility Sequential Patterns"],"prefix":"10.3390","volume":"14","author":[{"given":"Shiyong","family":"Xie","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Qilu University of Technology (Shandong Academy of Sciences), Jinan 250353, China"}]},{"given":"Long","family":"Zhao","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Qilu University of Technology (Shandong Academy of Sciences), Jinan 250353, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Zhou, L., Liu, Y., Wang, J., and Shi, Y. (2007, January 28\u201331). Utility-based web path traversal pattern mining. Proceedings of the Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007), Omaha, NE, USA.","DOI":"10.1109\/ICDMW.2007.72"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Truong-Chi, T., and Fournier-Viger, P. (2019). A survey of high utility sequential pattern mining. High-Utility Pattern Mining, Springer.","DOI":"10.1007\/978-3-030-04921-8"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Yin, J., Zheng, Z., and Cao, L. (2012, January 12\u201316). USpan: An efficient algorithm for mining high utility sequential patterns. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China.","DOI":"10.1145\/2339530.2339636"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10115-015-0914-8","article-title":"On efficiently mining high utility sequential patterns","volume":"49","author":"Wang","year":"2016","journal-title":"Knowl. Inf. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3781","DOI":"10.1007\/s10489-021-02536-7","article-title":"New approaches for mining regular high utility sequential patterns","volume":"52","author":"Ishita","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"676","DOI":"10.4218\/etrij.10.1510.0066","article-title":"A Novel Approach for Mining High-Utility Sequential Patterns in Sequence Databases","volume":"32","author":"Ahmed","year":"2010","journal-title":"ETRI J."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Yin, J., Zheng, Z., Cao, L., Song, Y., and Wei, W. (2013, January 7\u201310). Efficiently mining top-k high utility sequential patterns. Proceedings of the 2013 IEEE 13th international Conference on Data Mining, Dallas, TX, USA.","DOI":"10.1109\/ICDM.2013.148"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"5071","DOI":"10.1016\/j.eswa.2014.02.022","article-title":"Applying the maximum utility measure in high utility sequential pattern mining","volume":"41","author":"Lan","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2645","DOI":"10.1109\/TKDE.2015.2420557","article-title":"CRoM and HuspExt: Improving efficiency of high utility sequential pattern extraction","volume":"27","author":"Alkan","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Gan, W., Lin, J.C.W., Zhang, J., Chao, H.C., Fujita, H., and Philip, S.Y. (2019, January 6\u20139). ProUM: High utility sequential pattern mining. Proceedings of the 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), Bari, Italy.","DOI":"10.1109\/SMC.2019.8914402"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/TCYB.2020.2970176","article-title":"Fast utility mining on sequence data","volume":"51","author":"Gan","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ahmed, C.F., Tanbeer, S.K., and Jeong, B.S. (2010, January 9\u201311). Mining high utility web access sequences in dynamic web log data. Proceedings of the 2010 11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing, London, UK.","DOI":"10.1109\/SNPD.2010.21"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/s10489-012-0379-3","article-title":"Mining interesting user behavior patterns in mobile commerce environments","volume":"38","author":"Shie","year":"2013","journal-title":"Appl. Intell."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Zihayat, M., Davoudi, H., and An, A. (2016, January 15\u201318). Top-k utility-based gene regulation sequential pattern discovery. Proceedings of the 2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), Shenzhen, China.","DOI":"10.1109\/BIBM.2016.7822529"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Dinh, T., Huynh, V.N., and Le, B. (2017, January 3\u20135). Mining periodic high utility sequential patterns. Proceedings of the Asian Conference on Intelligent Information and Database Systems, Kanazawa, Japan.","DOI":"10.1007\/978-3-319-54472-4_51"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"4694","DOI":"10.1007\/s10489-018-1227-x","article-title":"An efficient algorithm for mining periodic high-utility sequential patterns","volume":"48","author":"Dinh","year":"2018","journal-title":"Appl. Intell."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Afriyie, M.K., Nofong, V.M., Wondoh, J., and Abdel-Fatao, H. (2020, January 23\u201326). Mining non-redundant periodic frequent patterns. Proceedings of the Asian Conference on Intelligent Information and Database Systems, Phuket, Thailand.","DOI":"10.1007\/978-3-030-41964-6_28"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Amphawan, K., Surarerks, A., and Lenca, P. (2010, January 9\u201310). Mining periodic-frequent itemsets with approximate periodicity using interval transaction-ids list tree. Proceedings of the 2010 Third International Conference on Knowledge Discovery and Data Mining, Phuket, Thailand.","DOI":"10.1109\/WKDD.2010.126"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Lin, C.W., Duong, Q.H., Dam, T.L., \u0160ev\u010d\u00edk, L., Uhrin, D., and Voznak, M. (2016, January 7). PFPM: Discovering periodic frequent patterns with novel periodicity measures. Proceedings of the 2nd Czech-China Scientific Conference 2016, Ostrava, Czech Republic.","DOI":"10.5772\/66780"},{"key":"ref_20","unstructured":"Kiran, R.U., Venkatesh, J., Fournier-Viger, P., Toyoda, M., Reddy, P.K., and Kitsuregawa, M. (2022, January 16\u201319). Discovering periodic patterns in non-uniform temporal databases. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Chengdu, China."},{"key":"ref_21","unstructured":"Fournier-Viger, P., Yang, P., Lin, J.C.W., and Kiran, R.U. (, January 19\u201322). Discovering stable periodic-frequent patterns in transactional data. Proceedings of the International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Kitakyushu, Japan."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"6917","DOI":"10.1007\/s10489-020-02181-6","article-title":"Tspin: Mining top-k stable periodic patterns","volume":"52","author":"Wang","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"e1242","DOI":"10.1002\/widm.1242","article-title":"A survey of incremental high-utility itemset mining","volume":"8","author":"Gan","year":"2018","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Wu, C.W., Zida, S., and Tseng, V.S. (2014, January 29\u201331). FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. Proceedings of the International Symposium on Methodologies for Intelligent Systems, Limassol, Cyprus.","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","article-title":"An effective tree structure for mining high utility itemsets","volume":"38","author":"Lin","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Lin, Y.C., Wu, C.W., and Tseng, V.S. (2015, January 16\u201319). Mining high utility itemsets in big data. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Chengdu, China.","DOI":"10.1007\/978-3-319-18032-8_51"},{"key":"ref_27","unstructured":"Liu, M., and Qu, J. (November, January 29). Mining high utility itemsets without candidate generation. Proceedings of the 21st ACM International Conference on Information and Knowledge Management, Maui, HI, USA."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","article-title":"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates","volume":"41","author":"Yun","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Zida, S., Fournier-Viger, P., Lin, J.C.W., Wu, C.W., and Tseng, V.S. (2015, January 25\u201330). EFIM: A highly efficient algorithm for high-utility itemset mining. Proceedings of the Mexican International Conference on Artificial Intelligence, Mexico City, Mexico.","DOI":"10.1007\/978-3-319-27060-9_44"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Amphawan, K., Lenca, P., and Surarerks, A. (2009, January 1\u20135). Mining top-k periodic-frequent pattern from transactional databases without support threshold. Proceedings of the International Conference on Advances in Information Technology, Bangkok, Thailand.","DOI":"10.1007\/978-3-642-10392-6_3"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.jss.2015.10.035","article-title":"Efficient discovery of periodic-frequent patterns in very large databases","volume":"112","author":"Kiran","year":"2016","journal-title":"J. Syst. Softw."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Surana, A., Kiran, R.U., and Reddy, P.K. (2011, January 24\u201327). An efficient approach to mine periodic-frequent patterns in transactional databases. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Shenzhen, China.","DOI":"10.1007\/978-3-642-28320-8_22"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.S., and Lee, Y.K. (2009, January 27\u201330). Discovering periodic-frequent patterns in transactional databases. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Bangkok, Thailand.","DOI":"10.1007\/978-3-642-01307-2_24"},{"key":"ref_34","unstructured":"Han, J., Dong, G., and Yin, Y. (1999, January 23\u201326). Efficient mining of partial periodic patterns in time series database. Proceedings of the 15th International Conference on Data Engineering (Cat. No. 99CB36337), Sydney, NSW, Australia."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Yu, X., and Yu, H. (2014, January 8\u201311). An asynchronous periodic sequential patterns mining algorithm with multiple minimum item supports. Proceedings of the 2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, Guangzhou, China.","DOI":"10.1109\/3PGCIC.2014.76"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Lin, J.C.W., Duong, Q.H., and Dam, T.L. (2016, January 13\u201317). PHM: Mining periodic high-utility itemsets. Proceedings of the Industrial Conference on Data Mining, New York, NY, USA.","DOI":"10.1007\/978-3-319-41561-1_6"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Lin, J.C.W., Zhang, J., and Fournier-Viger, P. (2017, January 23\u201325). High-utility sequential pattern mining with multiple minimum utility thresholds. Proceedings of the Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint Conference on Web and Big Data, Guangzhou, China.","DOI":"10.1007\/978-3-319-63579-8_17"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.aei.2017.04.007","article-title":"A two-phase approach to mine short-period high-utility itemsets in transactional databases","volume":"33","author":"Lin","year":"2017","journal-title":"Adv. Eng. Inform."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., and Yiu, T. (2002, January 23\u201326). Sequential pattern mining using a bitmap representation. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Canada.","DOI":"10.1145\/775047.775109"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Lin, J.C.W., Gomariz, A., Gueniche, T., Soltani, A., Deng, Z., and Lam, H.T. (2016, January 19\u201323). The SPMF open-source data mining library version 2. Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Riva del Garda, Italy.","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"2084","DOI":"10.1109\/TCYB.2018.2869907","article-title":"e-RNSP: An efficient method for mining repetition negative sequential patterns","volume":"50","author":"Dong","year":"2018","journal-title":"IEEE Trans. Cybern."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/10\/2032\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:41:27Z","timestamp":1760143287000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/10\/2032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":41,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["sym14102032"],"URL":"https:\/\/doi.org\/10.3390\/sym14102032","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]}}}