{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:03:06Z","timestamp":1768312986637,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030557881","type":"print"},{"value":"9783030557898","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-55789-8_70","type":"book-chapter","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T23:07:57Z","timestamp":1599174477000},"page":"820-831","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Fast Algorithm for Mining Closed Inter-transaction Patterns"],"prefix":"10.1007","author":[{"given":"Thanh-Ngo","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loan T.T.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ngoc Thanh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,4]]},"reference":[{"key":"70_CR1","unstructured":"Agrawal, R., Ramakrishnan, S.: Fast algorithms for mining association rules. In: Proceedings -the VLDB, pp. 487\u2013499 (1994)"},{"issue":"3","key":"70_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)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"70_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)","journal-title":"Data Min. Knowl. Discov."},{"issue":"3","key":"70_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K Gouda","year":"2005","unstructured":"Gouda, K., Zaki, M.J.: GenMax: an efficient algorithm for mining maximal frequent itemsets. Data Min. Knowl. Discov. 11(3), 223\u2013242 (2005)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"70_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24(1), 25\u201346 (1999)","journal-title":"Inf. Syst."},{"key":"70_CR6","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"70_CR7","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: {CLOSET+:} searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 236\u2013245 (2003)","DOI":"10.1145\/956750.956779"},{"issue":"4","key":"70_CR8","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. 17(4), 462\u2013478 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"70_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10115-014-0732-4","volume":"43","author":"J Sahoo","year":"2015","unstructured":"Sahoo, J., Das, A.K., Goswami, A.: An effective association rule mining scheme using a new generic basis. Knowl. Inf. Syst. 43(1), 127\u2013156 (2015)","journal-title":"Knowl. Inf. Syst."},{"issue":"9","key":"70_CR10","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"ZH Deng","year":"2012","unstructured":"Deng, Z.H., Wang, Z.H., Jiang, J.J.: A new algorithm for fast mining frequent itemsets using N-lists. Sci. China Inf. Sci. 55(9), 2008\u20132030 (2012)","journal-title":"Sci. China Inf. Sci."},{"issue":"13","key":"70_CR11","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"ZH Deng","year":"2015","unstructured":"Deng, Z.H., Lv, S.L.: PrePost+\u2009: an efficient N-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Syst. Appl. 42(13), 5424\u20135432 (2015)","journal-title":"Expert Syst. Appl."},{"key":"70_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.eswa.2018.03.041","volume":"105","author":"N Aryabarzan","year":"2018","unstructured":"Aryabarzan, N., Minaei-Bidgoli, B., Teshnehlab, M.: negFIN: An efficient algorithm for fast mining frequent itemsets. Expert Syst. Appl. 105, 129\u2013143 (2018)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"70_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s13042-014-0252-2","volume":"7","author":"B Vo","year":"2016","unstructured":"Vo, B., Le, T., Coenen, F., Hong, T.P.: Mining frequent itemsets using the N-list and subsume concepts. Int. J. Mach. Learn. Cybern. 7(2), 253\u2013265 (2016)","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"19","key":"70_CR14","doi-asserted-by":"publisher","first-page":"6648","DOI":"10.1016\/j.eswa.2015.04.048","volume":"42","author":"T Le","year":"2015","unstructured":"Le, T., Vo, B.: An N-list-based algorithm for mining frequent closed patterns. Expert Syst. Appl. 42(19), 6648\u20136657 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"70_CR15","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)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"70_CR16","doi-asserted-by":"publisher","first-page":"3453","DOI":"10.1016\/j.ins.2007.03.007","volume":"177","author":"AJT Lee","year":"2007","unstructured":"Lee, A.J.T., Wang, C.S.: An efficient algorithm for mining frequent inter-transaction patterns. Inf. Sci. (Ny) 177, 3453\u20133476 (2007)","journal-title":"Inf. Sci. (Ny)"},{"issue":"9","key":"70_CR17","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)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"70_CR18","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.datak.2008.02.001","volume":"66","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. 66(1), 68\u201391 (2008)","journal-title":"Data Knowl. Eng."},{"key":"70_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, T.N., Nguyen, L.T.T., Nguyen, N.T.: An improved algorithm for mining frequent inter-transaction patterns. In: Proceedings - IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA), pp. 296\u2013301 (2017)","DOI":"10.1109\/INISTA.2017.8001174"},{"key":"70_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Nguyen, L.T.T., Vo, B., Nguyen, N.: An efficient algorithm for mining frequent closed inter- transaction patterns. In: Proceedings - 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 2019\u20132024 (2019)","DOI":"10.1109\/SMC.2019.8914208"},{"key":"70_CR21","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. Proc. ACM Trans. Inf. Syst. 18, 423\u2013454 (2000)","journal-title":"Proc. ACM Trans. Inf. Syst."},{"issue":"1","key":"70_CR22","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)","journal-title":"Data Knowl. Eng."},{"issue":"2","key":"70_CR23","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)","journal-title":"VLDB J."},{"issue":"3\u20134","key":"70_CR24","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. (Ny) 172(3\u20134), 361\u2013395 (2005)","journal-title":"Inf. Sci. (Ny)"},{"key":"70_CR25","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, 13 (2014). ID 874825"},{"issue":"3","key":"70_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."},{"issue":"6","key":"70_CR27","first-page":"1521","volume":"31","author":"C Wang","year":"2015","unstructured":"Wang, C.: Mining non-redundant inter-transaction rules. J. Inf. Sci. Eng. 31(6), 1521\u20131536 (2015)","journal-title":"J. Inf. Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55789-8_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T10:41:08Z","timestamp":1608028868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-55789-8_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030557881","9783030557898"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55789-8_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IEA\/AIE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ieaaie2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jsasaki3.wixsite.com\/ieaaie2020\/organizations","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,35","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}