{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:16:51Z","timestamp":1753600611510,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T00:00:00Z","timestamp":1491177600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Algeria\/South Africa joint Project","award":["A\/AS-2013-002","A\/AS-2013-002"],"award-info":[{"award-number":["A\/AS-2013-002","A\/AS-2013-002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10115-017-1048-y","type":"journal-article","created":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T06:16:14Z","timestamp":1491200174000},"page":"439-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A formal series-based unification of the frequent itemset mining approaches"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6311-5081","authenticated-orcid":false,"given":"Slimane","family":"Oulad-Naoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadda","family":"Cherroun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djelloul","family":"Ziadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data, Washington DC, USA, pp 207\u2013216","key":"1048_CR1","DOI":"10.1145\/170035.170072"},{"unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: VLDB\u201994, proceedings of 20th international conference on very large data bases, 12\u201315 Sept 1994, Santiago de Chile, Chile, pp 487\u2013499. http:\/\/www.vldb.org\/conf\/1994\/P487.PDF","key":"1048_CR2"},{"issue":"1","key":"1048_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/360402.360421","volume":"2","author":"J Hipp","year":"2000","unstructured":"Hipp J, G\u00fcntzer U, Nakhaeizadeh G (2000) Algorithms for association rule mining\u2013a general survey and comparison. Sigkdd Explor 2(1):58\u201364. doi: 10.1145\/360402.360421","journal-title":"Sigkdd Explor"},{"unstructured":"Goethals B, Zaki MJ (eds) (2003) FIMI \u201903, In: Proceedings of the workshop on FIM Implementations, Melbourne, Florida, USA. CEUR workshop proceedings, vol. 90","key":"1048_CR4"},{"issue":"1","key":"1048_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386. doi: 10.1007\/s10618-006-0059-1","journal-title":"Data Min Knowl Discov"},{"doi-asserted-by":"publisher","unstructured":"Borgelt C (2012) Frequent item set mining\u2019. Wiley Interdisc Rew Data Min Knowl Discov 2(6):437\u2013456. doi: 10.1002\/widm.1074","key":"1048_CR6","DOI":"10.1002\/widm.1074"},{"doi-asserted-by":"publisher","unstructured":"Aggarwal CC, Bhuiyan M, Hasan MA (2014) Frequent pattern mining algorithms: a survey. In: Frequent pattern mining, pp 19\u201364 doi: 10.1007\/978-3-319-07821-2_2","key":"1048_CR7","DOI":"10.1007\/978-3-319-07821-2_2"},{"doi-asserted-by":"crossref","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","key":"1048_CR8","DOI":"10.1109\/69.846291"},{"doi-asserted-by":"publisher","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: Proceedings of the Ninth ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, USA, 24\u201327 Aug 2003, pp 326\u2013335. doi: 10.1145\/956750.956788","key":"1048_CR9","DOI":"10.1145\/956750.956788"},{"doi-asserted-by":"publisher","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, 16\u201318 May 2000, Dallas, Texas, USA, pp 1\u201312. doi: 10.1145\/342009.335372","key":"1048_CR10","DOI":"10.1145\/342009.335372"},{"doi-asserted-by":"publisher","unstructured":"Bayardo R (1998) Efficiently mining long patterns from databases. In: SIGMOD 1998, proceedings ACM SIGMOD international conference on management of data, 2\u20134 June 1998, Seattle, Washington, USA, pp 85\u201393. doi: 10.1145\/276304.276313","key":"1048_CR11","DOI":"10.1145\/276304.276313"},{"doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the 7th international conference on database theory, ICDT \u201999, Springer, Verlag, London, UK, pp 398\u2013416. http:\/\/dl.acm.org\/citation.cfm?id=645503.656256","key":"1048_CR12","DOI":"10.1007\/3-540-49257-7_25"},{"doi-asserted-by":"crossref","unstructured":"Cheung DWL, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: Proceedings of the fifth international conference on database systems for advanced applications (DASFAA). World Scientific Press, pp 185\u2013194. http:\/\/dl.acm.org\/citation.cfm?id=646711.703155","key":"1048_CR13","DOI":"10.1142\/9789812819536_0020"},{"issue":"6","key":"1048_CR14","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1016\/j.dam.2007.08.004","volume":"156","author":"P Valtchev","year":"2008","unstructured":"Valtchev P, Missaoui R, Godin R (2008) A framework for incremental generation of closed itemsets. Discrete Appl Math 156(6):924\u2013949. doi: 10.1016\/j.dam.2007.08.004","journal-title":"Discrete Appl Math"},{"unstructured":"Barbut M, Monjardet B (1970) Ordre et classification: alg\u00e8bre et combinatoire. Classiques Hachette, Hachette. http:\/\/books.google.fr\/books?id=n3BpSgAACAAJ","key":"1048_CR15"},{"unstructured":"Davey BA, Priestley HA (1990) Introduction to lattices and order. Cambridge University Press, Cambridge. http:\/\/www.worldcat.org\/search?qt=worldcat_org_all&q=0521367662","key":"1048_CR16"},{"key":"1048_CR17","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","volume":"11","author":"R Godin","year":"1995","unstructured":"Godin R, Missaoui R, Alaoui H (1995) Incremental concept formation algorithms based on galois (concept) lattices. Comput Intell 11:246\u2013267. doi: 10.1111\/j.1467-8640.1995.tb00031.x","journal-title":"Comput Intell"},{"unstructured":"Zaki MJ, Ogihara M (1998) Theoretical foundations of association rules. In: 3rd ACM SIGMOD workshop on research issues in data mining and knowledge discovery, June 1998","key":"1048_CR18"},{"issue":"4","key":"1048_CR19","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S0219622006002258","volume":"5","author":"Q Yang","year":"2006","unstructured":"Yang Q, Wu X (2006) 10 challenging problems in data mining research. Int J Inf Technol Decis Mak 5(4):597\u2013604. doi: 10.1142\/S0219622006002258","journal-title":"Int J Inf Technol Decis Mak"},{"doi-asserted-by":"crossref","unstructured":"Hoare T (1996) Unification of theories: a challenge for computing science. In: Haveraaen M, Owe O, Dahl O-J (eds) Recent trends in data type specification, 11th workshop on specification of abstract data types joint with the 8th COMPASS workshop, Oslo, Norway, 19\u201323 Sept 1995, selected papers, Springer, Berlin, Heidelberg, pp 49\u201357","key":"1048_CR20","DOI":"10.1007\/3-540-61629-2_35"},{"doi-asserted-by":"publisher","unstructured":"Oulad-Naoui S, Cherroun H, Ziadi D (2015) A unifying polynomial model for efficient discovery of frequent itemsets. In: Proceedings of 4th international conference on data management technologies and applications, pp 49\u201359. doi: 10.5220\/0005516200490059","key":"1048_CR21","DOI":"10.5220\/0005516200490059"},{"doi-asserted-by":"crossref","unstructured":"Salomaa A, Soittola M, Bauer F, Gries D (1978) Automata-theoretic aspects of formal power series. Texts and monographs in computer science. Springer, Verlag. http:\/\/books.google.fr\/books?id=TtdQAAAAMAAJ","key":"1048_CR22","DOI":"10.1007\/978-1-4612-6264-0"},{"unstructured":"Berstel J, Reutenauer C (1988) Rational series and their languages. EATCS monographs on theoretical computer science. Springer, Verlag. http:\/\/books.google.fr\/books?id=ZdhQAAAAMAAJ","key":"1048_CR23"},{"key":"1048_CR24","volume-title":"Introduction to automata theory, languages, and computation\u2013Addison-Wesley series in computer science","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft JE, Motwani R, Ullman JD (2001) Introduction to automata theory, languages, and computation\u2013Addison-Wesley series in computer science, 2nd edn. Addison-Wesley-Longman, Lodon","edition":"2"},{"key":"1048_CR25","first-page":"50","volume-title":"Idempotency","author":"J-E Pin","year":"1988","unstructured":"Pin J-E (1988) Tropical semirings. In: Gunawardena J (ed) Idempotency. Cambridge University Press, Cambridge, pp 50\u201369"},{"doi-asserted-by":"publisher","unstructured":"Cheung W, Za\u00efane OR (2003) Incremental mining of frequent patterns without candidate generation or support constraint. In: 7th International database engineering and applications symposium (IDEAS 2003), July 16\u201318 2003, Hong Kong, China, pp 111\u2013116. doi: 10.1109\/IDEAS.2003.1214917","key":"1048_CR26","DOI":"10.1109\/IDEAS.2003.1214917"},{"doi-asserted-by":"crossref","unstructured":"Goethals B (2004) Memory issues in frequent itemset mining. In: Proceedings of the 2004 ACM symposium on applied computing (SAC), Nicosia, Cyprus, 14-17 March 2004, pp 530\u2013534","key":"1048_CR27","DOI":"10.1145\/967900.968012"},{"issue":"2","key":"1048_CR28","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10115-012-0514-9","volume":"33","author":"SG Totad","year":"2012","unstructured":"Totad SG, Geeta RB, Reddy PVGDP (2012) Batch incremental processing for fp-tree construction using fp-growth algorithm. Knowl Inf Syst 33(2):475\u2013490. doi: 10.1007\/s10115-012-0514-9","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"1048_CR29","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ins.2009.09.003","volume":"180","author":"M Droste","year":"2010","unstructured":"Droste M, St\u00fcber T, Vogler H (2010) Weighted finite automata over strong bimonoids. Inf Sci 180(1):156\u2013166. doi: 10.1016\/j.ins.2009.09.003","journal-title":"Inf Sci"},{"issue":"4","key":"1048_CR30","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1111\/j.1467-9574.2010.00452.x","volume":"64","author":"W Pijls","year":"2010","unstructured":"Pijls W, Kosters WA (2010) Mining frequent itemsets: a perspective from operations research. Stat Neerl. 64(4):367\u2013387. doi: 10.1111\/j.1467-9574.2010.00452.x","journal-title":"Stat Neerl."},{"issue":"2","key":"1048_CR31","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10115-011-0408-2","volume":"31","author":"A Achar","year":"2012","unstructured":"Achar A, Laxman S, Sastry P (2012) A unified view of the apriori-based algorithms for frequent episode discovery. Knowl Inf Syst 31(2):223\u2013250. doi: 10.1007\/s10115-011-0408-2","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"1048_CR32","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H, Verkamo AI (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Discov 1(3):259\u2013289. doi: 10.1023\/A:1009748302351","journal-title":"Data Min Knowl Discov"},{"doi-asserted-by":"publisher","unstructured":"Mohri M (2009) Weighted automata algorithms. In: Droste M, Kuich W, Vogler H (eds) Handbook of weighted automata, monographs in theoretical computer science. An EATCS series. Springer, Berlin, pp 213\u2013254. doi: 10.1007\/978-3-642-01492-5_6","key":"1048_CR33","DOI":"10.1007\/978-3-642-01492-5_6"},{"doi-asserted-by":"publisher","unstructured":"Wu X, Kumar V, Quinlan JR, Ghosh J, Yang Q, Motoda H, McLachlan GJ, Ng AFM, Liu B, Yu PS, Steinbach Zhou Z-H, M, Hand DJ, Steinberg D, (2008) Top 10 algorithms in data mining. Knowl Inf Syst 14(1):1\u201337. doi: 10.1007\/s10115-007-0114-2","key":"1048_CR34","DOI":"10.1007\/s10115-007-0114-2"},{"unstructured":"Schmidt-Thieme L (2004) Algorithmic features of eclat.In: FIMI \u201904, proceedings of the IEEE ICDM workshop on frequent itemset mining implementations, Brighton, UK, Nov 1. http:\/\/ceur-ws.org\/Vol-126\/schmidtthieme.pdf","key":"1048_CR35"},{"doi-asserted-by":"publisher","unstructured":"Lv Deng Z-H, S-L, (2015) Prepost $${}^{\\text{+}}$$ + : an efficient n-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Syst Appl 42(13):5424\u20135432. doi: 10.1016\/j.eswa.2015.03.004","key":"1048_CR36","DOI":"10.1016\/j.eswa.2015.03.004"},{"unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U (2002) Reachability and distance queries via 2-hop labels. In: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA \u201902. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA pp 937\u2013946","key":"1048_CR37"},{"doi-asserted-by":"publisher","unstructured":"Deng Z-H, Wang Z (2010) A new fast vertical method for mining frequent patterns. Int J Comput Intell Syst 3(6):733\u2013744. doi: 10.1080\/18756891.2010.9727736","key":"1048_CR38","DOI":"10.1080\/18756891.2010.9727736"},{"doi-asserted-by":"publisher","unstructured":"Wang Deng Z-H, Z, Jiang J-J, (2012) A new algorithm for fast mining frequent itemsets using n-lists. Sci China Inf Sci 55(9):2008\u20132030. doi: 10.1007\/s11432-012-4638-z","key":"1048_CR39","DOI":"10.1007\/s11432-012-4638-z"},{"key":"1048_CR40","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, Boston","edition":"3"},{"unstructured":"fimdr (2003) Fimi repository for frequent itemset mining, implementations and datasets. http:\/\/fimi.ua.ac.be\/data\/","key":"1048_CR41"},{"unstructured":"Lichman M (2013) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml","key":"1048_CR42"},{"doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JC-W, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF open-source data mining library version 2. Proceedings of 19th European Conference on Principles of Data Mining and Knowledge Discovery PKDD 2016, pp 36\u201340","key":"1048_CR43","DOI":"10.1007\/978-3-319-46131-1_8"},{"doi-asserted-by":"publisher","unstructured":"R\u00e1cz B, Bodon F, Schmidt-Thieme L (2005) On benchmarking frequent itemset mining algorithms: From measurement to analysis. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, OSDM \u201905, ACM, New York, NY, USA, pp 36\u201345. doi: 10.1145\/1133905.1133911","key":"1048_CR44","DOI":"10.1145\/1133905.1133911"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1048-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1048-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1048-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T10:53:21Z","timestamp":1568976801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1048-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,3]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1048"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1048-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2017,4,3]]}}}