{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:24:25Z","timestamp":1770906265201,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001823","name":"Ministry of Education, Youth and Sports","doi-asserted-by":"crossref","award":["SP7\/2023"],"award-info":[{"award-number":["SP7\/2023"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"crossref","award":["CZ.10.03.01\/00\/22 003\/0000048"],"award-info":[{"award-number":["CZ.10.03.01\/00\/22 003\/0000048"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10489-024-06166-7","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T07:13:26Z","timestamp":1734938006000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A hierarchical set-enumeration tree enabling high occupancy item set mining and the use of an adaptive occupancy threshold"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7065-7951","authenticated-orcid":false,"given":"Thanh-Nam","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3464-3894","authenticated-orcid":false,"given":"Vinh","family":"Truong Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6603-392X","authenticated-orcid":false,"given":"Thanh-Cong","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5135-7980","authenticated-orcid":false,"given":"Miroslav","family":"Voznak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,23]]},"reference":[{"key":"6166_CR1","doi-asserted-by":"crossref","unstructured":"Kim S, Kim H, Cho M, Kim H, Vo B, Lin JC, Yun U (2023) Efficient approach for mining high-utility patterns on incremental databases with dynamic profits. Knowl-Based Syst 111060","DOI":"10.1016\/j.knosys.2023.111060"},{"key":"6166_CR2","doi-asserted-by":"crossref","unstructured":"Gordan M, Sabbagh-Yazdi SR, Ismail Z, Ghaedi K, Carroll P, McCrum D, Samali B (2022) State-of-the-art review on advancements of data mining in structural health monitoring. Measurement, page 110939","DOI":"10.1016\/j.measurement.2022.110939"},{"key":"6166_CR3","unstructured":"Witten IH, Frank E, Hall MA, Pal CJ, Data M (2005) Practical machine learning tools and techniques. In Data Mining, volume\u00a02"},{"issue":"1","key":"6166_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TKDE.2013.109","volume":"26","author":"X Wu","year":"2014","unstructured":"Wu X, Xingquan Z, Wu GQ, Wei D (2014) Data mining with big data. IEEE Trans Knowl Data Eng 26(1):97\u2013107","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6166_CR5","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10115-012-0537-2","volume":"33","author":"A Rezwan","year":"2012","unstructured":"Rezwan A, George K (2012) Algorithms for mining the evolution of conserved relational states in dynamic networks. Knowl Inf Syst 33:603\u2013630","journal-title":"Knowl Inf Syst"},{"issue":"5916","key":"6166_CR6","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1126\/science.1165821","volume":"323","author":"SP Borgatti","year":"2008","unstructured":"Borgatti SP, Mehra A, Brass DJ, Labianca G (2008) Network analysis in the social sciences. Science 323(5916):892\u2013895","journal-title":"Science"},{"key":"6166_CR7","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10115-012-0540-7","volume":"33","author":"C Yi-Cheng","year":"2012","unstructured":"Yi-Cheng C, Wen-Chih P, Suh-Yin L (2012) Efficient algorithms for influence maximization in social networks. Knowl Inf Syst 33:577\u2013601","journal-title":"Knowl Inf Syst"},{"key":"6166_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-011-0448-7","volume":"32","author":"DS Alzennyr","year":"2012","unstructured":"Alzennyr DS, Raja C, Georges H (2012) A clustering approach for sampling data streams in sensor networks. Knowl Inf Syst 32:1\u201323","journal-title":"Knowl Inf Syst"},{"key":"6166_CR9","doi-asserted-by":"publisher","first-page":"115157","DOI":"10.1109\/ACCESS.2022.3218799","volume":"10","author":"T Thanh-Nam","year":"2022","unstructured":"Thanh-Nam T, Thanh-Long N, Miroslav V (2022) Approaching k-means for multiantenna uav positioning in combination with a max-sic-min-rate framework to enable aerial iot networks. IEEE Access 10:115157\u2013115178","journal-title":"IEEE Access"},{"key":"6166_CR10","doi-asserted-by":"crossref","unstructured":"Tran TN, Nguyen TL, Hoang VT, Voznak M (2023) Sensor clustering using a k-means algorithm in combination with optimized unmanned aerial vehicle trajectory in wireless sensor networks. Sensors 23(4):2345","DOI":"10.3390\/s23042345"},{"key":"6166_CR11","doi-asserted-by":"crossref","unstructured":"Aggarwal CC (2014) An Introduction to Frequent Pattern Mining, pages 1\u201317. Springer International Publishing, Cham","DOI":"10.1007\/978-3-319-07821-2_1"},{"key":"6166_CR12","unstructured":"Agrawal R, Srikant R et\u00a0al (1994) Fast algorithms for mining association rules. In Proc. 20th int. conf. very large data bases, VLDB, volume 1215, pages 487\u2013499. Citeseer"},{"issue":"10","key":"6166_CR13","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Gosta","year":"2005","unstructured":"Gosta G, Jianfei Z (2005) Fast algorithms for frequent itemset mining using fp-trees. IEEE Trans Knowl Data Eng 17(10):1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"6166_CR14","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"D ZhiHong","year":"2012","unstructured":"ZhiHong D, ZhongHui W, JiaJian J (2012) A new algorithm for fast mining frequent itemsets using n-lists. SCIENCE CHINA Inf Sci 55(9):2008\u20132030","journal-title":"SCIENCE CHINA Inf Sci"},{"issue":"10","key":"6166_CR15","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"D Zhi-Hong","year":"2014","unstructured":"Zhi-Hong D, Sheng-Long L (2014) Fast mining frequent itemsets using nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"issue":"13","key":"6166_CR16","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"D Zhi-Hong","year":"2015","unstructured":"Zhi-Hong D, Sheng-Long L (2015) Prepost+: An efficient n-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Syst Appl 42(13):5424\u20135432","journal-title":"Expert Syst Appl"},{"issue":"19","key":"6166_CR17","doi-asserted-by":"publisher","first-page":"6648","DOI":"10.1016\/j.eswa.2015.04.048","volume":"42","author":"L Tuong","year":"2015","unstructured":"Tuong L, Bay V (2015) An n-list-based algorithm for mining frequent closed patterns. Expert Syst Appl 42(19):6648\u20136657","journal-title":"Expert Syst Appl"},{"key":"6166_CR18","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"D Zhi-Hong","year":"2016","unstructured":"Zhi-Hong D (2016) Diffnodesets: An efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"issue":"2","key":"6166_CR19","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1007\/s13369-021-06075-8","volume":"47","author":"D Subrata","year":"2022","unstructured":"Subrata D, Kalyani M, Udit G (2022) High occupancy itemset mining with consideration of transaction occupancy. Arab J Sci Eng 47(2):2061\u20132075","journal-title":"Arab J Sci Eng"},{"key":"6166_CR20","doi-asserted-by":"crossref","unstructured":"Tang L, Zhang L, Luo P, Wang M (2012) Incorporating occupancy into frequent pattern mining for high quality pattern recommendation. In Proceedings of the 21st ACM international conference on Information and knowledge management, pages 75\u201384","DOI":"10.1145\/2396761.2396775"},{"key":"6166_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121489","volume":"237","author":"NT Tung","year":"2024","unstructured":"Tung NT, Nguyen TDD, Nguyen LTT, Vo B (2024) An efficient method for mining high-utility itemsets from unstable negative profit databases. Expert Systems with Applications 237:121489","journal-title":"Expert Systems with Applications"},{"key":"6166_CR22","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.future.2019.07.039","volume":"102","author":"D Zhi-Hong","year":"2020","unstructured":"Zhi-Hong D (2020) Mining high occupancy itemsets. Futur Gener Comput Syst 102:222\u2013229","journal-title":"Futur Gener Comput Syst"},{"key":"6166_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen A, Nguyen NT, Nguyen LTT, Vo B (2023) An efficient pruning method for mining inter-sequence patterns based on pseudo-idlist. Expert Systems with Applications, page 121738","DOI":"10.1016\/j.eswa.2023.121738"},{"key":"6166_CR24","doi-asserted-by":"crossref","unstructured":"Kim H, Ryu T, Lee C, Kim S, Vo B, JC Lin, Yun U (2023) Efficient method for mining high utility occupancy patterns based on indexed list structure. IEEE Access 11:43140\u201343158","DOI":"10.1109\/ACCESS.2023.3271864"},{"key":"6166_CR25","doi-asserted-by":"crossref","unstructured":"Le T, Nguyen TL, Huynh B, Nguyen H, Hong TP, Snasel V (2021) Mining colossal patterns with length constraints. Appl Intell 1\u201312","DOI":"10.1007\/s10489-021-02357-8"},{"issue":"3","key":"6166_CR26","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1109\/TCYB.2019.2896267","volume":"50","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JC, Fournier-Viger P, Chao HC, Yu PS (2020) Huopm: High-utility occupancy pattern mining. IEEE Transactions on Cybernetics 50(3):1195\u20131208","journal-title":"IEEE Transactions on Cybernetics"},{"key":"6166_CR27","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.isatra.2022.05.003","volume":"131","author":"K Heonho","year":"2022","unstructured":"Heonho K, Taewoong R, Chanhee L, Hyeonmo K, Tin T, Philippe FV, Witold P, Unil Y (2022) Mining high occupancy patterns to analyze incremental data in intelligent systems. ISA Trans 131:460\u2013475","journal-title":"ISA Trans"},{"key":"6166_CR28","unstructured":"Rymon R (1992) Search through systematic set enumeration"},{"key":"6166_CR29","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1016\/j.ins.2020.10.001","volume":"546","author":"C Chien-Ming","year":"2021","unstructured":"Chien-Ming C, Lili C, Wensheng G, Lina Q, Weiping D (2021) Discovering high utility-occupancy patterns from uncertain data. Inf Sci 546:1208\u20131229","journal-title":"Inf Sci"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-06166-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-06166-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-06166-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:03:45Z","timestamp":1738253025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-06166-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,23]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["6166"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-06166-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,23]]},"assertion":[{"value":"6 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","order":2,"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 no known competing financial interests or personal relationships that may have influenced the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"205"}}