{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T02:55:54Z","timestamp":1767840954309,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10115-021-01575-3","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T08:03:17Z","timestamp":1621324997000},"page":"1873-1908","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["GrAFCI+ A fast generator-based algorithm for mining frequent closed itemsets"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3780-637X","authenticated-orcid":false,"given":"Makhlouf","family":"Ledmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Zidat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aboubekeur","family":"Hamdi-Cherif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,18]]},"reference":[{"key":"1575_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on very large data bases (VLDB \u201994), Morgan Kaufmann Publishers Inc., pp 487\u2013499"},{"issue":"2","key":"1575_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1093\/bib\/bbp042","volume":"11","author":"R Alves","year":"2010","unstructured":"Alves R, Rodr\u00edguez-Baena DS, Aguilar-Ruiz JS (2010) Gene association analysis: a survey of frequent pattern mining from gene expression data. Briefings Bioinform 11(2):210\u2013224","journal-title":"Briefings Bioinform"},{"issue":"11","key":"1575_CR3","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D Burdick","year":"2005","unstructured":"Burdick D, Calimlim M, Flannick J, Gehrke J, Yiu T (2005) MAFIA: a maximal frequent itemset algorithm. IEEE Trans Knowl Data Eng 17(11):1490\u20131504","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"13","key":"1575_CR4","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"Z Deng","year":"2015","unstructured":"Deng Z, Lv S (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":"6","key":"1575_CR5","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1080\/18756891.2010.9727736","volume":"3","author":"Z Deng","year":"2010","unstructured":"Deng Z, Wang Z (2010) A new fast vertical method for mining frequent patterns. Int J Comput Intell Syst 3(6):733\u2013744","journal-title":"Int J Comput Intell Syst"},{"issue":"9","key":"1575_CR6","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z Deng","year":"2012","unstructured":"Deng Z, Wang Z, Jiang J (2012) A new algorithm for fast mining frequent itemsets using n-lists. Sci China Inform Sci 55(9):2008\u20132030","journal-title":"Sci China Inform Sci"},{"issue":"12","key":"1575_CR7","doi-asserted-by":"publisher","first-page":"4775","DOI":"10.1007\/s10489-018-1245-8","volume":"48","author":"Y Djenouri","year":"2018","unstructured":"Djenouri Y, Djenouri D, Belhadi A, Fournier-Viger P, Lin JCW (2018) A new framework for metaheuristic-based frequent itemset mining. Appl Intell 48(12):4775\u20134791","journal-title":"Appl Intell"},{"key":"1575_CR8","unstructured":"Dong G, Feng M, Son NT, Lee TS, Li J, Liu G, Wong L (2002) pattern space projects. https:\/\/www.comp.nus.edu.sg\/~wongls\/projects\/pattern-spaces\/"},{"key":"1575_CR9","unstructured":"FIMI (2003) Frequent itemset mining dataset repository. http:\/\/fimi.cs.helsinki.fi\/data\/"},{"key":"1575_CR10","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JC, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF open-source data mining library version 2. In: LNCS, vol 9853, pp 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"},{"issue":"1","key":"1575_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1007730.1007744","volume":"6","author":"B Goethals","year":"2004","unstructured":"Goethals B, Zaki MJ (2004) Advances in frequent itemset mining implementations: Report on FIMI03. SIGKDD Explorat 6(1):109\u2013117","journal-title":"SIGKDD Explorat"},{"issue":"10","key":"1575_CR12","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu J (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":"2","key":"1575_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. SIGMOD Rec 29(2):1\u201312","journal-title":"SIGMOD Rec"},{"issue":"1","key":"1575_CR14","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 (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining Knowl Disc 8(1):53\u201387","journal-title":"Data Mining Knowl Disc"},{"key":"1575_CR15","first-page":"243","volume-title":"Data Mining: Concepts and Techniques, chap 6","author":"J Han","year":"2011","unstructured":"Han J, Kamber M, Pe J (2011) Data Mining: Concepts and Techniques, chap 6, 3rd edn. Morgan Kaufmann Publishers, Burlington, pp 243\u2013278","edition":"3"},{"key":"1575_CR16","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M (2001) Concise representation of frequent patterns based on disjunction-free generators. In: Proceedings 2001 IEEE international conference on data mining, pp 305\u2013312","DOI":"10.1109\/ICDM.2001.989533"},{"issue":"19","key":"1575_CR17","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 (2015) An n-list-based algorithm for mining frequent closed patterns. Expert Syst Appl 42(19):6648\u20136657","journal-title":"Expert Syst Appl"},{"key":"1575_CR18","unstructured":"Li J, Li H, Wong L, Pei J, Dong G (2006) Minimum description length principle: generators are preferable to closed patterns. In: Proceedings of the 21st national conference on artificial intelligence - Volume 1, AAAI Press, pp 409\u2013414"},{"issue":"1","key":"1575_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-007-0111-5","volume":"17","author":"G Liu","year":"2008","unstructured":"Liu G, Li J, Wong L (2008) A new concise representation of frequent itemsets using generators and a positive border. Knowl Inf Syst 17(1):35\u201356","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"1575_CR20","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 (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1575_CR21","doi-asserted-by":"publisher","first-page":"113087","DOI":"10.1016\/j.eswa.2019.113087","volume":"143","author":"H Nam","year":"2020","unstructured":"Nam H, Yun U, Yoon E, Lin JCW (2020) Efficient approach for incremental weighted erasable pattern mining with list structure. Expert Syst Appl 143:113087","journal-title":"Expert Syst Appl"},{"key":"1575_CR22","doi-asserted-by":"crossref","unstructured":"Pan F, Cong G, Tung AKH, Yang J, Zaki MJ (2003) Carpenter: Finding closed patterns in long biological datasets. In: Proceedings of the 9th ACM SIGKDD conference, pp 637\u2014-642","DOI":"10.1145\/956750.956832"},{"issue":"1","key":"1575_CR23","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 (1999) Efficient mining of association rules using closed itemset lattices. Inf Syst 24(1):25\u201346","journal-title":"Inf Syst"},{"key":"1575_CR24","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: workshop on research issues in data mining and knowledge discovery, pp 21\u201330"},{"issue":"5","key":"1575_CR25","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/s10115-003-0133-6","volume":"6","author":"J Pei","year":"2004","unstructured":"Pei J, Dong G, Zou W, Han J (2004) Mining condensed frequent-pattern bases. Knowl Inf Syst 6(5):570\u2013594","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"1575_CR26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10115-014-0732-4","volume":"43","author":"J Sahoo","year":"2015","unstructured":"Sahoo J, Ashok KD, Goswami A (2015) An effective association rule mining scheme using a new generic basis. Knowl Inf Syst 43(1):127\u2013156","journal-title":"Knowl Inf Syst"},{"key":"1575_CR27","doi-asserted-by":"publisher","first-page":"136511","DOI":"10.1109\/ACCESS.2019.2943015","volume":"7","author":"J Sun","year":"2019","unstructured":"Sun J, Xun Y, Zhang J, Li J (2019) Incremental frequent itemsets mining with FCFP tree. IEEE Access 7:136511\u2013136524","journal-title":"IEEE Access"},{"issue":"8","key":"1575_CR28","doi-asserted-by":"publisher","first-page":"7196","DOI":"10.1016\/j.eswa.2012.01.062","volume":"39","author":"B Vo","year":"2012","unstructured":"Vo B, Hong TP, Le B (2012) DBV-Miner: a dynamic bit-vector approach for fast mining frequent closed itemsets. Expert Syst Appl 39(8):7196\u20137206","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1575_CR29","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 (2016) Mining frequent itemsets using the n-list and subsume concepts. Int J Mach Learn Cyber 7(2):253\u2013265","journal-title":"Int J Mach Learn Cyber"},{"key":"1575_CR30","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.eswa.2016.12.023","volume":"73","author":"B Vo","year":"2017","unstructured":"Vo B, Pham S, Le T, Deng Z (2017) A novel approach for mining maximal frequent patterns. Expert Syst Appl 73:178\u2013186","journal-title":"Expert Syst Appl"},{"key":"1575_CR31","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) Closet+: Searching for the best strategies for mining frequent closed itemsets. In: Proc of the 9th ACM SIGKDD conference, pp 236\u2013245","DOI":"10.1145\/956750.956779"},{"key":"1575_CR32","doi-asserted-by":"crossref","unstructured":"Xu Y, Li Y (2007) Generating concise association rules. In: Proceedings of the sixteenth ACM conference on information and knowledge management (CIKM \u201907), pp 781\u2013790","DOI":"10.1145\/1321440.1321549"},{"issue":"3","key":"1575_CR33","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1575_CR34","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ, Hsiao C (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1575_CR35","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1007\/s13042-018-00918-x","volume":"10","author":"C Zhang","year":"2019","unstructured":"Zhang C, Tian P, Zhang X, Liao Q, Jiang ZL, Wang X (2019) HashEclat: an efficient frequent itemset algorithm. Int J Mach Learn Cyber 10:3003\u20133016","journal-title":"Int J Mach Learn Cyber"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01575-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-021-01575-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01575-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T07:07:52Z","timestamp":1624000072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-021-01575-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,18]]},"references-count":35,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1575"],"URL":"https:\/\/doi.org\/10.1007\/s10115-021-01575-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,18]]},"assertion":[{"value":"7 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}