{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T11:52:26Z","timestamp":1768305146107,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032093172","type":"print"},{"value":"9783032093189","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09318-9_26","type":"book-chapter","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:54:30Z","timestamp":1762775670000},"page":"379-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for Mining Top-Rank-k Frequent Closed Inter-transaction Patterns"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3137-8308","authenticated-orcid":false,"given":"Thanh-Ngo","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,9]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA, 26\u201328 May 1993, pp. 207\u2013216. ACM Press (1993). https:\/\/doi.org\/10.1145\/170035.170072","DOI":"10.1145\/170035.170072"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372\u2013390 (2000). https:\/\/doi.org\/10.1109\/69.846291","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53\u201387 (2004). https:\/\/doi.org\/10.1023\/B:DAMI.0000005258.31418.83","journal-title":"Data Min. Knowl. Discov."},{"key":"26_CR4","doi-asserted-by":"publisher","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal,L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Cham (1999). https:\/\/doi.org\/10.1007\/3-540-49257-7_25","DOI":"10.1007\/3-540-49257-7_25"},{"key":"26_CR5","doi-asserted-by":"publisher","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: an efficient algorithm for closed itemset mining, pp. 457\u2013473 (2002). https:\/\/doi.org\/10.1137\/1.9781611972726.27","DOI":"10.1137\/1.9781611972726.27"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese, C., Orlando, S., Perego, R.: Fast and memory efficient mining of frequent closed itemsets. IEEE Trans. Knowl. Data Eng. 18(1), 21\u201336 (2006). https:\/\/doi.org\/10.1109\/TKDE.2006.10","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"120363","DOI":"10.1016\/J.INS.2024.120363","volume":"665","author":"X Chen","year":"2024","unstructured":"Chen, X., Cai, J., Chen, G., Gan, W., Broustet, A.: FCSG-Miner: Frequent closed subgraph mining in multi-graphs. Inf. Sci. 665, 120363 (2024). https:\/\/doi.org\/10.1016\/J.INS.2024.120363","journal-title":"Inf. Sci."},{"key":"26_CR8","doi-asserted-by":"publisher","unstructured":"Fang, G.D., Deng, Z.H.: VTK: vertical mining of top-rank-K frequent patterns. In: Proceedings - 5th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, pp. 620\u2013624 (2008). https:\/\/doi.org\/10.1109\/FSKD.2008.472","DOI":"10.1109\/FSKD.2008.472"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.3233\/JIFS-169128","volume":"32","author":"LTT Nguyen","year":"2017","unstructured":"Nguyen, L.T.T., Trinh, T., Nguyen, N.T., Vo, B.: A method for mining top-rank-k frequent closed itemsets. J. Intell. Fuzzy Syst. 32(2), 1297\u20131305 (2017). https:\/\/doi.org\/10.3233\/JIFS-169128","journal-title":"J. Intell. Fuzzy Syst."},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/s10489-015-0748-9","volume":"45","author":"TL Dam","year":"2016","unstructured":"Dam, T.L., Li, K., Fournier-Viger, P., Duong, Q.H.: An efficient algorithm for mining top-rank-k frequent patterns. Appl. Intell. 45(1), 96\u2013111 (2016). https:\/\/doi.org\/10.1007\/s10489-015-0748-9","journal-title":"Appl. Intell."},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.eswa.2014.07.045","volume":"42","author":"Q Huynh-Thi-Le","year":"2015","unstructured":"Huynh-Thi-Le, Q., Le, T., Vo, B., Le, B.: An efficient and effective algorithm for mining top-rank-k frequent patterns. Expert Syst. Appl. 42(1), 156\u2013164 (2015). https:\/\/doi.org\/10.1016\/j.eswa.2014.07.045","journal-title":"Expert Syst. Appl."},{"issue":"4 PART 2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1763","DOI":"10.1016\/j.eswa.2013.08.075","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng, Z.H.: Fast mining top-rank-k frequent patterns by using node-lists. Expert Syst. Appl. 41(4 PART 2), 1763\u20131768 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2013.08.075","journal-title":"Expert Syst. Appl."},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Abdelaal, A.A., Abed, S., Al-Shayeji, M., Allaho, M.: Customized frequent patterns mining algorithms for enhanced Top-Rank-K frequent pattern mining. Expert Syst. Appl. 169 (2021). https:\/\/doi.org\/10.1016\/j.eswa.2020.114530","DOI":"10.1016\/j.eswa.2020.114530"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2017.09.010","volume":"68","author":"T Le","year":"2018","unstructured":"Le, T., Vo, B., Baik, S.W.: Efficient algorithms for mining top-rank-k erasable patterns using pruning strategies and the subsume concept. Eng. Appl. Artif. Intell. 68, 1\u20139 (2018). https:\/\/doi.org\/10.1016\/j.engappai.2017.09.010","journal-title":"Eng. Appl. Artif. Intell."},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Vo, B., Bui, H., Vo, T., Le, T.: Mining top-rank-k frequent weighted itemsets using WN-list structures and an early pruning strategy. Knowl. Based Syst. 201\u2013202 (2020). https:\/\/doi.org\/10.1016\/j.knosys.2020.106064","DOI":"10.1016\/j.knosys.2020.106064"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets, p. 326 (2004). https:\/\/doi.org\/10.1145\/956755.956788","DOI":"10.1145\/956755.956788"},{"key":"26_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.03.007","author":"AJT Lee","year":"2007","unstructured":"Lee, A.J.T., Wang, C.S.: An efficient algorithm for mining frequent inter-transaction patterns. Inf. Sci. (N Y) (2007). https:\/\/doi.org\/10.1016\/j.ins.2007.03.007","journal-title":"Inf. Sci. (N Y)"},{"issue":"4","key":"26_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/358108.358114","volume":"18","author":"H Lu","year":"2000","unstructured":"Lu, H., Feng, L., Han, J.: Beyond intratransaction association analysis: mining multidimensional intertransaction association rules. ACM Trans. Inf. Syst. 18(4), 423\u2013454 (2000). https:\/\/doi.org\/10.1145\/358108.358114","journal-title":"ACM Trans. Inf. Syst."},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0169-023X(01)00003-9","volume":"37","author":"L Feng","year":"2001","unstructured":"Feng, L., Dillon, T., Liu, J.: Inter-transactional association rules for multi-dimensional contexts for prediction and their application to studying meteorological data. Data Knowl. Eng. 37(1), 85\u2013115 (2001). https:\/\/doi.org\/10.1016\/S0169-023X(01)00003-9","journal-title":"Data Knowl. Eng."},{"issue":"2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00778-002-0069-6","volume":"11","author":"L Feng","year":"2002","unstructured":"Feng, L., Yu, J.X., Lu, H., Han, J.: A template model for multidimensional inter-transactional association rules. VLDB J. 11(2), 153\u2013175 (2002). https:\/\/doi.org\/10.1007\/s00778-002-0069-6","journal-title":"VLDB J."},{"issue":"1","key":"26_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TKDE.2003.1161581","volume":"15","author":"AKH Tung","year":"2003","unstructured":"Tung, A.K.H., Lu, H., Han, J., Feng, L.: Efficient mining of intertransaction association rules. IEEE Trans. Knowl. Data Eng. 15(1), 43\u201356 (2003). https:\/\/doi.org\/10.1109\/TKDE.2003.1161581","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3\u20134","key":"26_CR22","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.ins.2004.07.006","volume":"172","author":"Q Li","year":"2005","unstructured":"Li, Q., Feng, L., Wong, A.: From intra-transaction to generalized inter-transaction: Landscaping multidimensional contexts in association rule mining. Inf. Sci. (N Y) 172(3\u20134), 361\u2013395 (2005). https:\/\/doi.org\/10.1016\/j.ins.2004.07.006","journal-title":"Inf. Sci. (N Y)"},{"key":"26_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2008.02.001","author":"AJT Lee","year":"2008","unstructured":"Lee, A.J.T., Wang, C.S., Weng, W.Y., Chen, Y.A., Wu, H.W.: An efficient algorithm for mining closed inter-transaction itemsets. Data Knowl. Eng. (2008). https:\/\/doi.org\/10.1016\/j.datak.2008.02.001","journal-title":"Data Knowl. Eng."},{"issue":"9","key":"26_CR24","doi-asserted-by":"publisher","first-page":"11024","DOI":"10.1016\/j.eswa.2011.02.146","volume":"38","author":"CS Wang","year":"2011","unstructured":"Wang, C.S., Chu, K.C.: Using a projection-based approach to mine frequent inter-transaction patterns. Expert Syst. Appl. 38(9), 11024\u201311031 (2011). https:\/\/doi.org\/10.1016\/j.eswa.2011.02.146","journal-title":"Expert Syst. Appl."},{"key":"26_CR25","doi-asserted-by":"publisher","unstructured":"Hsieh, Y.L., Yang, D.L., Wu, J.: Effective application of improved profit-mining algorithm for the interday trading model. Sci. World J. 2014 (2014). https:\/\/doi.org\/10.1155\/2014\/874825","DOI":"10.1155\/2014\/874825"},{"issue":"3","key":"26_CR26","first-page":"575","volume":"32","author":"YL Hsieh","year":"2016","unstructured":"Hsieh, Y.L., Yang, D.L., Wu, J., Chen, Y.C.: Efficient mining of profit rules from closed inter-transaction itemsets. J. Inf. Sci. Eng. 32(3), 575\u2013595 (2016)","journal-title":"J. Inf. Sci. Eng."},{"key":"26_CR27","doi-asserted-by":"publisher","unstructured":"Nguyen, T.N., Nguyen, L.T.T., Nguyen, N.T.: An improved algorithm for mining frequent Inter-transaction patterns. In: Proceedings - 2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications, INISTA 2017, pp. 296\u2013301 (2017). https:\/\/doi.org\/10.1109\/INISTA.2017.8001174","DOI":"10.1109\/INISTA.2017.8001174"},{"key":"26_CR28","doi-asserted-by":"publisher","first-page":"116840","DOI":"10.1109\/ACCESS.2020.3004530","volume":"8","author":"TN Nguyen","year":"2020","unstructured":"Nguyen, T.N., Nguyen, L.T.T., Vo, B., Nguyen, N.T., Nguyen, T.D.D.: An N-list-based approach for mining frequent inter-transaction patterns. IEEE Access 8, 116840\u2013116855 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3004530","journal-title":"IEEE Access"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Nguyen, L.T.T., Vo, B., Nguyen, N., Member, S.: An efficient algorithm for mining frequent closed inter-transaction patterns (2019)","DOI":"10.1109\/SMC.2019.8914208"},{"key":"26_CR30","doi-asserted-by":"publisher","unstructured":"Nguyen, T.-N., Nguyen, L.T.T., Vo, B., Nguyen, N.T.: A fast algorithm for mining closed inter-transaction patterns. In: Fujita, H., Fournier-Viger, P., Ali, M., Sasaki, J. (eds.) IEA\/AIE 2020. LNCS, vol. 12144, pp. 820\u2013831. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55789-8_70","DOI":"10.1007\/978-3-030-55789-8_70"},{"key":"26_CR31","doi-asserted-by":"publisher","unstructured":"Nguyen, T.-N., Loan, N.T.T., Vo, B., Kozierkiewicz, A.: Efficient method for mining maximal inter-transaction patterns. In: Nguyen, N.T., Hoang, B.H., Huynh, C.-P., Hwang, D., Trawinski, B., Vossen, G. (eds.) ICCCI 2020. LNCS, vol. 12496, pp. 316\u2013327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63007-2_25","DOI":"10.1007\/978-3-030-63007-2_25"},{"key":"26_CR32","doi-asserted-by":"publisher","unstructured":"Nguyen, T.-N.: dMITP-miner: an efficient method for mining maximal inter-transaction patterns. In: Szczerbicki, E., Wojtkiewicz, K., Van Nguyen, S., Pietranik, M., Kr\u00f3tkiewicz, M. (eds.) ACIIDS 2022. CCIS, vol. 1716, pp. 409\u2013422. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-981-19-8234-7_32","DOI":"10.1007\/978-981-19-8234-7_32"},{"key":"26_CR33","doi-asserted-by":"publisher","unstructured":"Nguyen, T.-N.: nMITP-miner: an efficient method for mining frequent maximal inter-transaction patterns. In: Nguyen, N.T., et al. (eds.) ICCCI 2024, Part I. LNCS, vol. 14810, pp. 346\u2013358. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-70816-9_27","DOI":"10.1007\/978-3-031-70816-9_27"},{"issue":"4","key":"26_CR34","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1142\/S2196888822500221","volume":"9","author":"H Nguyen","year":"2022","unstructured":"Nguyen, H.: An improving approach for top-rank- k frequent pattern mining. Viet. J. Comput. Sci. 9(4), 417\u2013433 (2022). https:\/\/doi.org\/10.1142\/S2196888822500221","journal-title":"Viet. J. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09318-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:02:42Z","timestamp":1768280562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09318-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,9]]},"ISBN":["9783032093172","9783032093189"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09318-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,9]]},"assertion":[{"value":"9 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}