{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:45:00Z","timestamp":1781019900565,"version":"3.54.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T00:00:00Z","timestamp":1666224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T00:00:00Z","timestamp":1666224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100010248","name":"Zhejiang Province Public Welfare Technology Application Research Project","doi-asserted-by":"publisher","award":["LGF19H180002"],"award-info":[{"award-number":["LGF19H180002"]}],"id":[{"id":"10.13039\/501100010248","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010248","name":"Zhejiang Province Public Welfare Technology Application Research Project","doi-asserted-by":"publisher","award":["LGF21H180010"],"award-info":[{"award-number":["LGF21H180010"]}],"id":[{"id":"10.13039\/501100010248","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LZ20F020001"],"award-info":[{"award-number":["LZ20F020001"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Intell Syst"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Statistically significant pattern mining (SSPM) is to mine patterns with significance based on hypothesis test. Under the constraint of statistical significance, our study aims to introduce a new preference relation into high utility patterns and to discover high utility and significant patterns (HUSPs) from transaction datasets, which has never been considered in existing SSPM problems. Our approach can be divided into two parts, HUSP-Mining and HUSP-Test. HUSP-Mining looks for HUSP candidates and HUSP-Test tests their significance. HUSP-Mining is not outputting all high utility itemsets (HUIs) as HUSP candidates; it is established based on candidate length and testable support requirements which can remove many insignificant HUIs early in the mining process; compared with the traditional HUIs mining algorithm, it can get candidates in a short time without losing the real HUSPs. HUSP-Test is to draw significant patterns from the results of HUSP-Mining based on Fisher\u2019s test. We propose an iterative multiple testing procedure, which can alternately and efficiently reject a hypothesis and safely ignore the hypotheses that have less utility than the rejected hypothesis. HUSP-Test controls Family-wise Error Rate (FWER) under a user-defined threshold by correcting the test level which can find more HUSPs than standard Bonferroni\u2019s control. Substantial experiments on real datasets show that our algorithm can draw HUSPs efficiently from transaction datasets with strong mathematical guarantee.<\/jats:p>","DOI":"10.1007\/s44196-022-00149-7","type":"journal-article","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T13:04:59Z","timestamp":1666271099000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Mining Statistically Significant Patterns with High Utility"],"prefix":"10.1007","volume":"15","author":[{"given":"Huijun","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4245-3246","authenticated-orcid":false,"given":"Jiangbo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yangguang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao-Zhi","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"149_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04921-8","volume-title":"High-Utility Pattern Mining: Theory","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Vo, B., Nkambou, R., Tseng, V.S.: High-Utility Pattern Mining: Theory. Algorithms and Applications. Springer, Heidelberg (2019)"},{"issue":"2","key":"149_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1109\/TCYB.2020.2970176","volume":"51","author":"W Gan","year":"2021","unstructured":"Gan, W., Lin, J.C.-W., Zhang, J.: Fast utility mining on sequence data. IEEE Trans. Cybern. 51(2), 487\u2013500 (2021)","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"149_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TKDE.2018.2833478","volume":"31","author":"T Truong","year":"2019","unstructured":"Truong, T., Duong, H., Le, B.: Fournier-Viger, P, Efficient Vertical Mining of High Average-Utility Itemsets based on Novel Upper-Bounds. IEEE Trans. Knowl. Data Eng. 31(2), 301\u2013314 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"149_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-007-5006-x","volume":"68","author":"GI Webb","year":"2017","unstructured":"Webb, G.I.: Discovering significant patterns. Mach. Learn. 68, 1\u201333 (2017)","journal-title":"Mach. Learn."},{"key":"149_CR5","doi-asserted-by":"publisher","first-page":"12996","DOI":"10.1073\/pnas.1302233110","volume":"110","author":"A Terada","year":"2013","unstructured":"Terada, A., Okada-Hatakeyama, M., Tsuda, K.: Statistical significance of combinatorial regulations. Proc. Natl. Acad. Sci. 110, 12996\u201313001 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"149_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10115-011-0432-2","volume":"32","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2012","unstructured":"H\u00e4m\u00e4l\u00e4inen, W.: Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measures. Knowl. Inf. Syst. 32, 383\u2013414 (2012)","journal-title":"Knowl. Inf. Syst."},{"key":"149_CR7","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.eswa.2018.12.046","volume":"122","author":"Z He","year":"2019","unstructured":"He, Z., Zhang, S., Jun, Wu.: Significance-based discriminative sequential pattern mining. Expert Syst. Appl. 122, 54\u201364 (2019)","journal-title":"Expert Syst. Appl."},{"key":"149_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.compbiolchem.2015.02.009","volume":"57","author":"C Zhao","year":"2015","unstructured":"Zhao, C., Liu, D., Teng, B., He, Z.: Protein inference through machine learning. Comput. Biol. Chem. 57, 12\u201320 (2015)","journal-title":"Comput. Biol. Chem."},{"key":"149_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2020.3019817","volume":"99","author":"S Cheng","year":"2020","unstructured":"Cheng, S., Yang, D., Yang, T., Zhang, H., Cui, B.: LTC: a fast algorithm to accurately find significant items in data streams. IEEE Trans. Know. Data Eng. 99, 1 (2020)","journal-title":"IEEE Trans. Know. Data Eng."},{"issue":"1","key":"149_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114789","volume":"176","author":"KP Chiao","year":"2021","unstructured":"Chiao, K.P.: Multi-criteria decision making with interval type 2 fuzzy Bonferroni mean. Expert Syst. Appl. 176(1), 114789 (2021)","journal-title":"Expert Syst. Appl."},{"key":"149_CR11","doi-asserted-by":"crossref","unstructured":"Thien Q, Tran, Kazuto Fukuchi, Youhei Akimoto, Statistically Significant Pattern Mining with Ordinal Utility In: Proceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1645\u20131653(2020)","DOI":"10.1145\/3394486.3403215"},{"key":"149_CR12","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10994-008-5046-x","volume":"71","author":"GI Webb","year":"2008","unstructured":"Webb, G.I.: Layered critical values: a powerful direct-adjustment approach to discovering significant patterns. Mach. Learn. 71, 307\u2013323 (2008)","journal-title":"Mach. Learn."},{"key":"149_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10618-018-0590-x","volume":"33","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2019","unstructured":"H\u00e4m\u00e4l\u00e4inen, W., Webb, G.I.: A tutorial on statistically sound pattern discovery. Data Min Knowl Disc. 33, 325\u2013377 (2019)","journal-title":"Data Min Knowl Disc."},{"key":"149_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.csda.2015.08.002","volume":"93","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2016","unstructured":"H\u00e4m\u00e4l\u00e4inen, W.: New upper bounds for tight and fast approximation of Fisher\u2019s exact test in dependency rule mining. Comp. Stat. & Data Anal. 93, 469\u2013482 (2016)","journal-title":"Comp. Stat. & Data Anal."},{"key":"149_CR15","doi-asserted-by":"crossref","unstructured":"Leonardo Pellegrina, Matteo Riondato, Fabio Vandin, SPuManTE: Significant Pattern Mining with Unconditional Testing In: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1528\u20131538(2019)","DOI":"10.1145\/3292500.3330978"},{"issue":"2","key":"149_CR16","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1214\/13-AOS1090","volume":"41","author":"E Chung","year":"2013","unstructured":"Chung, E., Romano, J.: P, Exact and asymptotically robust permutation tests. Ann. Statist. 41(2), 484\u2013507 (2013)","journal-title":"Ann. Statist."},{"key":"149_CR17","first-page":"146","volume":"346\u2013347","author":"Wu Jun","year":"2019","unstructured":"Jun, Wu., He, Z., Feiyang, Gu., Liu, X., Zhou, J., Yang, C.: Computing exact permutation p-values for association rules. Inf. Sci. 346\u2013347, 146\u2013162 (2019)","journal-title":"Inf. Sci."},{"key":"149_CR18","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1007\/s10618-020-00687-8","volume":"34","author":"L Pellegrina","year":"2020","unstructured":"Pellegrina, L., Vandin, F.: Efficient mining of the most significant patterns with permutation testing. Data Min. Knowl. Disc. 34, 1201\u20131234 (2020)","journal-title":"Data Min. Knowl. Disc."},{"key":"149_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1186\/s12918-017-0475-4","volume":"11","author":"M Zihayat","year":"2017","unstructured":"Zihayat, M., Davoudi, H.: Aijun An2, Mining significant high utility gene regulation sequential patterns. BMC Syst. Biol. 11, 109 (2017)","journal-title":"BMC Syst. Biol."},{"key":"149_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00169","author":"A Tonon","year":"2019","unstructured":"Tonon, A., Vandin, F.: Permutation strategies for mining significant sequential patterns. IEEE Int. Conf. Data. Min. (2019). https:\/\/doi.org\/10.1109\/ICDM.2019.00169","journal-title":"IEEE Int. Conf. Data. Min."},{"key":"149_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.005","volume":"182","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger, P., Cheng, C., Cheng, Z., Lin, C.W.: Mining significant trend sequences in dynamic attributed graphs. Knowl. Based Syst. 182, 104797 (2019)","journal-title":"Knowl. Based Syst."},{"issue":"10","key":"149_CR22","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1007\/s10115-021-01550-y","volume":"63","author":"M Seyfi","year":"2021","unstructured":"Seyfi, M., Nayak, R., Yue, Xu., Geva, S.: Mining discriminative itemsets in data streams using the tilted-time window model. Knowl. Inf. Syst. 63(10), 1241\u20131270 (2021)","journal-title":"Knowl. Inf. Syst."},{"issue":"6","key":"149_CR23","doi-asserted-by":"publisher","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"CW Lin","year":"2011","unstructured":"Lin, C.W., Hong, T.P., Lu, W.H.: An effective tree structure for mining high utility itemsets. Expert Syst. Appl. 38(6), 7419\u20137424 (2011)","journal-title":"Expert Syst. Appl."},{"key":"149_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3362070","volume":"1","author":"W Gan","year":"2020","unstructured":"Gan, W., Lin, J.C.-W., Zhang, J.: Utility mining across multi-sequences with individualized thresholds. ACM\/IMS Trans. Data Sci. 1, 1\u201329 (2020)","journal-title":"ACM\/IMS Trans. Data Sci."},{"key":"149_CR25","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.ins.2021.04.035","volume":"570","author":"C Zhang","year":"2021","unstructured":"Zhang, C., Du, Z., Gan, W., Yu, P.S.: TKUS: mining top-k high utility sequential patterns. Inf. Sci. 570, 342\u2013359 (2021)","journal-title":"Inf. Sci."},{"key":"149_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115449","volume":"184","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Lei, R., Li, Y.: GB Lei, XWE F, HAOP-Miner: Self-adaptive high-average utility one-off sequential pattern mining. Expert Syst. Appl. 184, 115449 (2021)","journal-title":"Expert Syst. Appl."},{"key":"149_CR27","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","volume":"55","author":"Jerry Chun-Wei Lin","year":"2016","unstructured":"Jerry Chun-Wei Lin: Lu Yang, Philippe Fournier-Viger, Mining high-utility itemsets based on particle swarm optimization. Eng. Appl. Artif. Intell. 55, 320\u2013330 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"149_CR28","first-page":"38","volume":"3","author":"W Song","year":"2021","unstructured":"Song, W., Li, J.: Discovering high utility itemsets using set-based particle swarm optimization. Adv. Data Min. Appl. 3, 38\u201353 (2021)","journal-title":"Adv. Data Min. Appl."},{"key":"149_CR29","doi-asserted-by":"crossref","unstructured":"Song W., Zheng C., Fournier-Viger P, Mining Skyline Frequent-Utility Itemsets with Utility Filtering. 18th Pacific Rim International Conf on Artificial Intelligence (PRICAI 2021): Trends in Artificial Intelligence. 411\u2013424 (2021)","DOI":"10.1007\/978-3-030-89188-6_31"},{"issue":"1","key":"149_CR30","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF02984820","volume":"27","author":"GL Alexanderson","year":"2005","unstructured":"Alexanderson, G.L.: Gamma: exploring euler\u2019s constant. Math. Intell. 27(1), 86\u201388 (2005)","journal-title":"Math. Intell."},{"issue":"27","key":"149_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines. ACM Trans.Intell. Syst. Technol. 2(27), 1\u20132 (2011)","journal-title":"ACM Trans.Intell. Syst. Technol."},{"key":"149_CR32","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A.: T, Gueniche, Spmf: a java open source pattern mining library. J. Mach. Learn. Res. 15, 3389\u20133393 (2014)","journal-title":"J. Mach. Learn. Res."}],"container-title":["International Journal of Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-022-00149-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44196-022-00149-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-022-00149-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T13:07:39Z","timestamp":1666271259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44196-022-00149-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,20]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["149"],"URL":"https:\/\/doi.org\/10.1007\/s44196-022-00149-7","relation":{},"ISSN":["1875-6883"],"issn-type":[{"value":"1875-6883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,20]]},"assertion":[{"value":"2 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to Participate"}},{"value":"All authors have reviewed the final version of the manuscript and approved it for publication.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"88"}}