{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:27:26Z","timestamp":1775021246016,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,20]],"date-time":"2015-10-20T00:00:00Z","timestamp":1445299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council (BE)","doi-asserted-by":"publisher","award":["ICT-2013-612944"],"award-info":[{"award-number":["ICT-2013-612944"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10115-015-0884-x","type":"journal-article","created":{"date-parts":[[2015,10,20]],"date-time":"2015-10-20T07:14:34Z","timestamp":1445325274000},"page":"429-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":74,"title":["CloFAST: closed sequential pattern mining using sparse and vertical id-lists"],"prefix":"10.1007","volume":"48","author":[{"given":"Fabio","family":"Fumarola","sequence":"first","affiliation":[]},{"given":"Pasqua Fabiana","family":"Lanotte","sequence":"additional","affiliation":[]},{"given":"Michelangelo","family":"Ceci","sequence":"additional","affiliation":[]},{"given":"Donato","family":"Malerba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,20]]},"reference":[{"key":"884_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of the eleventh international conference on data engineering, ICDE \u201995. IEEE Computer Society, Washington, DC, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"884_CR2","doi-asserted-by":"crossref","unstructured":"Ayres J, Flannick J, Gehrke J, Yiu T (2002) Sequential pattern mining using a bitmap representation. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201902. ACM, New York, NY, pp 429\u2013435","DOI":"10.1145\/775047.775109"},{"issue":"11","key":"884_CR3","doi-asserted-by":"crossref","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":"3","key":"884_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10844-006-9950-x","volume":"27","author":"M Ceci","year":"2006","unstructured":"Ceci M, Appice A (2006) Spatial associative classification: propositional vs structural approach. J Intell Inf Syst 27(3):191\u2013213","journal-title":"J Intell Inf Syst"},{"key":"884_CR5","doi-asserted-by":"crossref","unstructured":"Ceci M, Lanotte PF, Fumarola F, Cavallo DP, Malerba D (2014) Completion time and next activity prediction of processes using sequential pattern mining. In: Dzeroski S, Panov P, Kocev D, Todorovski L (eds) Discovery science\u201417th international conference, DS 2014, Bled, Slovenia, October 8\u201310, 2014. Proceedings, volume 8777 of Lecture Notes in Computer Science, Springer, pp 49\u201361","DOI":"10.1007\/978-3-319-11812-3_5"},{"key":"884_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4419-6800-5_5","volume-title":"Mathematical approaches to polymer sequence analysis and related problems","author":"M Ceci","year":"2011","unstructured":"Ceci M, Loglisci C, Salvemini E, D\u2019Elia D, Malerba D (2011) Mining spatial association rules for composite motif discovery. In: Bruni R (ed) Mathematical approaches to polymer sequence analysis and related problems. Springer, Berlin, pp 87\u2013109"},{"issue":"3","key":"884_CR7","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/s10618-012-0284-8","volume":"26","author":"L Cerf","year":"2013","unstructured":"Cerf L, Besson J, Nguyen K-N, Boulicaut J-F (2013) Closed and noise-tolerant patterns in n-ary relations. Data Min Knowl Discov 26(3):574\u2013619","journal-title":"Data Min Knowl Discov"},{"key":"884_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10115-006-0003-0","volume":"10","author":"Y Chi","year":"2006","unstructured":"Chi Y, Wang H, Yu PS, Muntz RR (2006) Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Knowl Inf Syst 10:265\u2013294","journal-title":"Knowl Inf Syst"},{"key":"884_CR9","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.datak.2008.05.007","volume":"66","author":"TP Exarchos","year":"2008","unstructured":"Exarchos TP, Tsipouras MG, Papaloukas C, Fotiadis DI (2008) A two-stage methodology for sequence classification based on sequential pattern mining and optimization. Data Knowl Eng 66:467\u2013487","journal-title":"Data Knowl Eng"},{"key":"884_CR10","unstructured":"Fournier-Viger P (2014) SPMF: a sequential pattern mining framework. http:\/\/www.philippe-fournier-viger.com\/spmf\/index.php . Accessed 08 Aug 2014"},{"key":"884_CR11","doi-asserted-by":"crossref","unstructured":"Fradkin D, Moerchen F (2010) Margin-closed frequent sequential pattern mining. In: Proceedings of the ACM SIGKDD workshop on useful patterns, UP \u201910. ACM, New York, NY, pp 45\u201354","DOI":"10.1145\/1816112.1816119"},{"key":"884_CR12","doi-asserted-by":"crossref","unstructured":"Gomariz A, Campos M, Mar\u00edn R, Goethals B (2013) ClaSP: an efficient algorithm for mining frequent closed sequences. In: Pei J, Tseng VS, Cao L, Motoda H, Xu G (eds) PAKDD (1), vol 7818 of Lecture Notes in Computer Science. Springer, Berlin, pp 50\u201361","DOI":"10.1007\/978-3-642-37453-1_5"},{"key":"884_CR13","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2005","unstructured":"Han J (2005) Data mining: concepts and techniques. Morgan Kaufmann Publishers Inc., San Francisco"},{"key":"884_CR14","doi-asserted-by":"crossref","unstructured":"Huang K-Y, Chang C-H, Tung J-H, Ho C-T (2006) COBRA: closed sequential pattern mining using bi-phase reduction approach. In: Tjoa AM, Trujillo J (eds) DaWaK, vol 4081 of Lecture Notes in Computer Science. Springer, Berlin, pp 280\u2013291","DOI":"10.1007\/11823728_27"},{"issue":"9","key":"884_CR15","first-page":"1017","volume":"5","author":"GG Jingjun Zhu","year":"2010","unstructured":"Jingjun Zhu GG, Wu Haiyan (2010) An efficient method of web sequential pattern mining based on session filter and transaction identification. J Netw 5(9):1017\u20131024","journal-title":"J Netw"},{"key":"884_CR16","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/TSE.2006.28","volume":"32","author":"Z Li","year":"2006","unstructured":"Li Z, Lu S, Myagmar S, Zhou Y (2006) Cp-miner: finding copy-paste and related bugs in large-scale software code. IEEE Trans Softw Eng 32:176\u2013192","journal-title":"IEEE Trans Softw Eng"},{"key":"884_CR17","doi-asserted-by":"crossref","first-page":"2677","DOI":"10.1016\/j.eswa.2008.01.021","volume":"36","author":"F Masseglia","year":"2009","unstructured":"Masseglia F, Poncelet P, Teisseire M (2009) Efficient mining of sequential patterns with time constraints: reducing the combinations. Expert Syst Appl Int J 36:2677\u20132690","journal-title":"Expert Syst Appl Int J"},{"key":"884_CR18","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001) PrefixSpan: mining sequential patterns by prefix-projected growth. In: Proceedings of the 17th international conference on data engineering. IEEE Computer Society, Washington, DC, pp 215\u2013224"},{"key":"884_CR19","doi-asserted-by":"crossref","unstructured":"Salvemini E, Fumarola F, Malerba D, Han J (2011) FAST sequence mining based on sparse id-lists. In: Kryszkiewicz M, Rybinski H, Skowron A, Ras ZW (eds) ISMIS, vol 6804 of Lecture Notes in Computer Science, Springer, Berlin, pp 316\u2013325","DOI":"10.1007\/978-3-642-21916-0_35"},{"key":"884_CR20","doi-asserted-by":"crossref","unstructured":"Song S, Hu H, Jin S (2005) HVSM: a new sequential pattern mining algorithm using bitmap representation. In: Li X, Wang S, Dong Z (eds) Advanced Data Mining and Applications, vol 3584, Lecture Notes in Computer ScienceSpringer, Berlin Heidelberg, pp 455\u2013463","DOI":"10.1007\/11527503_55"},{"key":"884_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-S6-S25","volume":"10","author":"A Turi","year":"2009","unstructured":"Turi A, Loglisci C, Salvemini E, Grillo G, Malerba D, D\u2019Elia D (2009) Computational annotation of UTR cis-regulatory modules through frequent pattern mining. BMC Bioinform 10:1\u201312. doi: 10.1186\/1471-2105-10-S6-S25","journal-title":"BMC Bioinform"},{"key":"884_CR22","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/TKDE.2007.1043","volume":"19","author":"J Wang","year":"2007","unstructured":"Wang J, Han J, Li C (2007) Frequent closed sequence mining without candidate maintenance. IEEE Trans. Knowl. Data Eng. 19:1042\u20131056","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"884_CR23","doi-asserted-by":"crossref","unstructured":"Yan X, Han J, Afshar R (2003) CloSpan: mining closed sequential patterns in large datasets. In: SDM, pp 166\u2013177","DOI":"10.1137\/1.9781611972733.15"},{"key":"884_CR24","doi-asserted-by":"crossref","unstructured":"Yang Z, Kitsuregawa M (2005) LAPIN-SPAM: an improved algorithm for mining sequential pattern. In: 22nd international conference on data engineering workshops, vol 0, pp 1222","DOI":"10.1109\/ICDE.2005.235"},{"issue":"1\u20132","key":"884_CR25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ (2001) SPADE: an efficient algorithm for mining frequent sequences. Mach Learn 42(1\u20132):31\u201360","journal-title":"Mach Learn"},{"key":"884_CR26","doi-asserted-by":"crossref","unstructured":"Zhang X, Dong G, Ramamohanarao K (2000) Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets. In: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD \u201900). ACM, New York, 310\u2013314. http:\/\/dx.doi.org\/10.1145\/347090.347158","DOI":"10.1145\/347090.347158"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0884-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0884-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0884-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:11:18Z","timestamp":1559110278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0884-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,20]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["884"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0884-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,20]]}}}