{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:09:16Z","timestamp":1773655756884,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/N013980\/1"],"award-info":[{"award-number":["EP\/N013980\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s40537-019-0200-9","type":"journal-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:56:41Z","timestamp":1557784601000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Fast implementation of pattern mining algorithms with time stamp uncertainties and temporal constraints"],"prefix":"10.1186","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4453-0180","authenticated-orcid":false,"given":"Sofya S.","family":"Titarenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valeriy N.","family":"Titarenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Aivaliotis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Palczewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"key":"200_CR1","doi-asserted-by":"publisher","DOI":"10.3390\/sym10040093","author":"J-H Huh","year":"2018","unstructured":"Huh J-H. Big data analysis for personalized health activities: machine learning processing for automatic keyword extraction approach. Symmetry. 2018;. \n                    https:\/\/doi.org\/10.3390\/sym10040093\n                    \n                  .","journal-title":"Symmetry"},{"issue":"1","key":"200_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10115-015-0819-6","volume":"46","author":"I Batal","year":"2016","unstructured":"Batal I, Cooper GF, Fradkin D, Harrison J, Moerchen F, Hauskrecht M. An efficient pattern mining approach for event detection in multivariate temporal data. Knowl Inform Syst. 2016;46(1):115\u201350. \n                    https:\/\/doi.org\/10.1007\/s10115-015-0819-6\n                    \n                  .","journal-title":"Knowl Inform Syst"},{"key":"200_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-018-2440-4","author":"S Lee","year":"2018","unstructured":"Lee S, Huh J-H. An effective security measures for nuclear power plant using big data analysis approach. J Supercomput. 2018;. \n                    https:\/\/doi.org\/10.1007\/s11227-018-2440-4\n                    \n                  .","journal-title":"J Supercomput"},{"issue":"C","key":"200_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.bdr.2015.11.003","volume":"4","author":"C Yu","year":"2016","unstructured":"Yu C, Boyd J. $$\\text{ Fb }^{+}$$-tree for big data management. Big Data Res. 2016;4(C):25\u201336. \n                    https:\/\/doi.org\/10.1016\/j.bdr.2015.11.003\n                    \n                  .","journal-title":"Big Data Res"},{"issue":"2","key":"200_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A. Mining association rules between sets of items in large databases. SIGMOD Rec. 1993;22(2):207\u201316. \n                    https:\/\/doi.org\/10.1145\/170036.170072\n                    \n                  .","journal-title":"SIGMOD Rec."},{"key":"200_CR6","doi-asserted-by":"publisher","unstructured":"Agrawal R, Srikant R. Mining sequential patterns. In: Proceedings of the eleventh international conference on data engineering; 1995. p. 3\u201314. \n                    https:\/\/doi.org\/10.1109\/ICDE.1995.380415\n                    \n                  .","DOI":"10.1109\/ICDE.1995.380415"},{"issue":"1\/2","key":"200_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ. SPADE: an efficient algorithm for mining frequent sequences. Mach Learn. 2001;42(1\/2):31\u201360. \n                    https:\/\/doi.org\/10.1023\/A:1007652502315\n                    \n                  .","journal-title":"Mach Learn"},{"key":"200_CR8","doi-asserted-by":"publisher","unstructured":"Ayres J, Flannick J, Gehrke J, Yiu T. Sequential pattern mining using a bitmap representation. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201902. New York: ACM. 2002. p. 429\u201335. \n                    https:\/\/doi.org\/10.1145\/775047.775109\n                    \n                  .","DOI":"10.1145\/775047.775109"},{"key":"200_CR9","doi-asserted-by":"publisher","unstructured":"Han J, Pei J, Mortazavi-Asl B, Chen Q, Dayal U, Hsu M-C. Freespan: frequent pattern-projected sequential pattern mining. In: Proceedings of the sixth ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201900. ACM, New York, NY, USA. 2000. p. 355\u20139. \n                    https:\/\/doi.org\/10.1145\/347090.347167\n                    \n                  .","DOI":"10.1145\/347090.347167"},{"key":"200_CR10","doi-asserted-by":"publisher","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M-C. Prefixspan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings 17th international conference on data engineering. 2001. p. 215\u201324. \n                    https:\/\/doi.org\/10.1109\/ICDE.2001.914830\n                    \n                  .","DOI":"10.1109\/ICDE.2001.914830"},{"key":"200_CR11","doi-asserted-by":"publisher","unstructured":"Yan X, Han J, Afshar R. CloSpan: mining: closed sequential patterns in large datasets. p. 166\u201377. \n                    https:\/\/doi.org\/10.1137\/1.9781611972733.15\n                    \n                  .","DOI":"10.1137\/1.9781611972733.15"},{"key":"200_CR12","doi-asserted-by":"publisher","unstructured":"Wang J, Han J. Bide: efficient mining of frequent closed sequences. In: Proceedings. 20th international conference on data engineering. 2004. p. 79\u201390. \n                    https:\/\/doi.org\/10.1109\/ICDE.2004.1319986\n                    \n                  .","DOI":"10.1109\/ICDE.2004.1319986"},{"issue":"1","key":"200_CR13","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 Mining Knowl Dis. 2004;8(1):53\u201387. \n                    https:\/\/doi.org\/10.1023\/B:DAMI.0000005258.31418.83\n                    \n                  .","journal-title":"Data Mining Knowl Dis"},{"issue":"3","key":"200_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1006\/jpdc.2000.1695","volume":"61","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ. Parallel sequence mining on shared-memory machines. J Parallel Distrib Comput. 2001;61(3):401\u201326. \n                    https:\/\/doi.org\/10.1006\/jpdc.2000.1695\n                    \n                  .","journal-title":"J Parallel Distrib Comput"},{"key":"200_CR15","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-39707-6_36","volume-title":"High Perform Comput","author":"T Sutou","year":"2003","unstructured":"Sutou T, Tamura K, Mori Y, Kitakami H. Design and implementation of parallel modified prefixspan method. In: Veidenbaum A, Joe K, Amano H, Aiso H, editors. High Perform Comput. Berlin: Springer; 2003. p. 412\u201322. \n                    https:\/\/doi.org\/10.1007\/978-3-540-39707-6_36\n                    \n                  ."},{"key":"200_CR16","unstructured":"Vu L, Alaghband G. A load balancing parallel method for frequent pattern mining on multi-core cluster. In: Proceedings of the symposium on high performance computing. HPC \u201915. Society for computer simulation international, San Diego, CA, USA. 2015. p. 49\u201358. \n                    http:\/\/dl.acm.org\/citation.cfm?id=2872599.2872606\n                    \n                  ."},{"issue":"3","key":"200_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1080\/18756891.2010.9727705","volume":"3","author":"S Qiao","year":"2010","unstructured":"Qiao S, Li T, Peng J, Qiu J. Parallel sequential pattern mining of massive trajectory data. Int J Comput Intell Syst. 2010;3(3):343\u201356. \n                    https:\/\/doi.org\/10.1080\/18756891.2010.9727705\n                    \n                  .","journal-title":"Int J Comput Intell Syst"},{"issue":"1","key":"200_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/s40537-015-0030-3","volume":"2","author":"C-W Tsai","year":"2015","unstructured":"Tsai C-W, Lai C-F, Chao H-C, Vasilakos AV. Big data analytics: a survey. J Big Data. 2015;2(1):21. \n                    https:\/\/doi.org\/10.1186\/s40537-015-0030-3\n                    \n                  .","journal-title":"J Big Data"},{"key":"200_CR19","doi-asserted-by":"crossref","unstructured":"Kocheturov A, Momcilovic P, Bihorac A, Pardalos PM. Extended vertical lists for temporal pattern mining from multivariate time series. 2018. \n                    arXiv:1804.10025\n                    \n                  .","DOI":"10.1111\/exsy.12448"},{"issue":"2","key":"200_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10618-007-0064-z","volume":"15","author":"J Lin","year":"2007","unstructured":"Lin J, Keogh E, Wei L, Lonardi S. Experiencing sax: a novel symbolic representation of time series. Data Mining Knowl Dis. 2007;15(2):107\u201344. \n                    https:\/\/doi.org\/10.1007\/s10618-007-0064-z\n                    \n                  .","journal-title":"Data Mining Knowl Dis"},{"key":"200_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jbi.2016.11.006","volume":"65","author":"J Zhao","year":"2017","unstructured":"Zhao J, Papapetrou P, Asker L, Bostr\u00f6m H. Learning from heterogeneous temporal data in electronic health records. J Biomed Inform. 2017;65:105\u201319. \n                    https:\/\/doi.org\/10.1016\/j.jbi.2016.11.006\n                    \n                  .","journal-title":"J Biomed Inform"},{"issue":"1","key":"200_CR22","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s40537-018-0112-0","volume":"5","author":"S Rathee","year":"2018","unstructured":"Rathee S, Kashyap A. Adaptive-miner: an efficient distributed association rule mining algorithm on Spark. J Big Data. 2018;5(1):6. \n                    https:\/\/doi.org\/10.1186\/s40537-018-0112-0\n                    \n                  .","journal-title":"J Big Data"},{"issue":"12","key":"200_CR23","doi-asserted-by":"publisher","first-page":"15143","DOI":"10.1016\/j.eswa.2011.05.090","volume":"38","author":"C-W Lin","year":"2011","unstructured":"Lin C-W, Hong T-P. Temporal data mining with up-to-date pattern trees. Exp Syst Appl. 2011;38(12):15143\u201350. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2011.05.090\n                    \n                  .","journal-title":"Exp Syst Appl"},{"issue":"4","key":"200_CR24","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1016\/j.eswa.2012.08.061","volume":"40","author":"F Guil","year":"2013","unstructured":"Guil F, Bail\u00f3n A, \u00c1lvarez JA, Mar\u00edn R. Mining generalized temporal patterns based on fuzzy counting. Exp Syst Appl. 2013;40(4):1296\u2013304. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2012.08.061\n                    \n                  .","journal-title":"Exp Syst Appl"},{"issue":"1","key":"200_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-014-0784-5","volume":"45","author":"R Moskovitch","year":"2015","unstructured":"Moskovitch R, Shahar Y. Classification of multivariate time series via temporal abstraction and time intervals mining. Knowl Inform Syst. 2015;45(1):35\u201374. \n                    https:\/\/doi.org\/10.1007\/s10115-014-0784-5\n                    \n                  .","journal-title":"Knowl Inform Syst"},{"issue":"1","key":"200_CR26","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10115-014-0815-2","volume":"46","author":"Y-C Chen","year":"2016","unstructured":"Chen Y-C, Weng JT-Y, Hui L. A novel algorithm for mining closed temporal patterns from interval-based data. Knowl Inform Syst. 2016;46(1):151\u201383. \n                    https:\/\/doi.org\/10.1007\/s10115-014-0815-2\n                    \n                  .","journal-title":"Knowl Inform Syst"},{"key":"200_CR27","doi-asserted-by":"publisher","unstructured":"Yao J, Kong S. The application of stream data time-series pattern reliance mining in stock market analysis. In: 2008 IEEE international conference on service operations and logistics, and informatics, vol. 1. 2008. p. 159\u201363. \n                    https:\/\/doi.org\/10.1109\/SOLI.2008.4686383\n                    \n                  .","DOI":"10.1109\/SOLI.2008.4686383"},{"key":"200_CR28","doi-asserted-by":"publisher","unstructured":"Zhu C, Zhang X, Sun J, Huang B. Algorithm for mining sequential pattern in time series data. In: 2009 WRI international conference on communications and mobile computing, vol. 3. 2009. p. 258\u201362. \n                    https:\/\/doi.org\/10.1109\/CMC.2009.208\n                    \n                  .","DOI":"10.1109\/CMC.2009.208"},{"issue":"2","key":"200_CR29","doi-asserted-by":"publisher","first-page":"252","DOI":"10.4304\/jnw.9.2.252-258","volume":"9","author":"J Chen","year":"2014","unstructured":"Chen J, Chen P. Sequential pattern mining for uncertain data streams using sequential sketch. J Netw. 2014;9(2):252\u20138. \n                    https:\/\/doi.org\/10.4304\/jnw.9.2.252-258\n                    \n                  .","journal-title":"J Netw"},{"issue":"2","key":"200_CR30","first-page":"183","volume":"13","author":"VS Reddy","year":"2017","unstructured":"Reddy VS, Rao TV, Govardhan A. CASW: context aware sliding window for frequent itemset mining over data streams. Int J Comput Intell Res. 2017;13(2):183\u201396.","journal-title":"Int J Comput Intell Res"},{"key":"200_CR31","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-07821-2_9","volume-title":"Frequent Pattern Mining","author":"Victor E. Lee","year":"2014","unstructured":"Lee VE, Jin R, Agrawal G. In: Aggarwal CC, Han J (eds). Frequent pattern mining in data streams. Cham: Springer; 2014. p. 199\u2013224. \n                    https:\/\/doi.org\/10.1007\/978-3-319-07821-2_9\n                    \n                  ."},{"key":"200_CR32","doi-asserted-by":"publisher","unstructured":"Giannotti F, Nanni M, Pinelli F, Pedreschi D. Trajectory pattern mining. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201907. New York: ACM; 2007. p. 330\u20139. \n                    https:\/\/doi.org\/10.1145\/1281192.1281230\n                    \n                  .","DOI":"10.1145\/1281192.1281230"},{"issue":"2","key":"200_CR33","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10115-009-0196-0","volume":"21","author":"P Papapetrou","year":"2009","unstructured":"Papapetrou P, Kollios G, Sclaroff S, Gunopulos D. Mining frequent arrangements of temporal intervals. Knowl Inform Syst. 2009;21(2):133. \n                    https:\/\/doi.org\/10.1007\/s10115-009-0196-0\n                    \n                  .","journal-title":"Knowl Inform Syst"},{"issue":"6","key":"200_CR34","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TKDE.2007.190613","volume":"19","author":"SY Wu","year":"2007","unstructured":"Wu SY, Chen YL. Mining nonambiguous temporal patterns for interval-based events. IEEE Trans Knowl Data Eng. 2007;19(6):742\u201358. \n                    https:\/\/doi.org\/10.1109\/TKDE.2007.190613\n                    \n                  .","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"200_CR35","doi-asserted-by":"publisher","first-page":"59","DOI":"10.5121\/ijcsa.2014.4406","volume":"4","author":"M Kalaivany","year":"2014","unstructured":"Kalaivany M, Uma V. Mining sequential patterns for interval based events by applying multiple constraints. Int J Comput Sci Appl. 2014;4(4):59\u201366. \n                    https:\/\/doi.org\/10.5121\/ijcsa.2014.4406\n                    \n                  .","journal-title":"Int J Comput Sci Appl"},{"key":"200_CR36","doi-asserted-by":"publisher","unstructured":"Ruan G, Zhang H, Plale B. Parallel and quantitative sequential pattern mining for large-scale interval-based temporal data. In: 2014 IEEE international conference on Big Data (Big Data). 2014. p. 32\u20139. \n                    https:\/\/doi.org\/10.1109\/BigData.2014.7004410\n                    \n                  .","DOI":"10.1109\/BigData.2014.7004410"},{"key":"200_CR37","doi-asserted-by":"publisher","unstructured":"Palczewska A, Palczewski J, Aivaliotis G, Kowalik L. RobustSPAM for inference from noisy longitudinal data and preservation of privacy. In: 2017 16th IEEE international conference on machine learning and applications (ICMLA). 2017. p. 344\u201351. \n                    https:\/\/doi.org\/10.1109\/ICMLA.2017.0-137\n                    \n                  .","DOI":"10.1109\/ICMLA.2017.0-137"},{"issue":"1","key":"200_CR38","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.pmcj.2009.10.004","volume":"6","author":"P Palmes","year":"2010","unstructured":"Palmes P, Pung HK, Gu T, Xue W, Chen S. Object relevance weight pattern mining for activity recognition and segmentation. Pervasive Mobile Comput. 2010;6(1):43\u201357. \n                    https:\/\/doi.org\/10.1016\/j.pmcj.2009.10.004\n                    \n                  .","journal-title":"Pervasive Mobile Comput"},{"issue":"1","key":"200_CR39","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/568574.568580","volume":"4","author":"J Pei","year":"2002","unstructured":"Pei J, Han J. Constrained frequent pattern mining: a pattern-growth view. SIGKDD Explor Newslett. 2002;4(1):31\u20139. \n                    https:\/\/doi.org\/10.1145\/568574.568580\n                    \n                  .","journal-title":"SIGKDD Explor Newslett"},{"key":"200_CR40","doi-asserted-by":"publisher","unstructured":"Pei J, Han J, Wang W. Mining sequential patterns with constraints in large databases. In: Proceedings of the eleventh international conference on information and knowledge management. CIKM \u201902. New York: ACM. 2002. p. 18\u201325. \n                    https:\/\/doi.org\/10.1145\/584792.584799\n                    \n                  .","DOI":"10.1145\/584792.584799"},{"key":"200_CR41","doi-asserted-by":"publisher","unstructured":"Bonchi F, Lucchese C. On closed constrained frequent pattern mining. In: ICDM \u201904. Fourth IEEE international conference on data mining. 2004. p. 35\u201342. \n                    https:\/\/doi.org\/10.1109\/ICDM.2004.10093\n                    \n                  .","DOI":"10.1109\/ICDM.2004.10093"},{"issue":"2","key":"200_CR42","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF02719780","volume":"31","author":"S Laxman","year":"2006","unstructured":"Laxman S, Sastry PS. A survey of temporal data mining. Sadhana. 2006;31(2):173\u201398. \n                    https:\/\/doi.org\/10.1007\/BF02719780\n                    \n                  .","journal-title":"Sadhana"},{"issue":"1","key":"200_CR43","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. Frequent pattern mining: current status and future directions. Data Mining Knowl Dis. 2007;15(1):55\u201386. \n                    https:\/\/doi.org\/10.1007\/s10618-006-0059-1\n                    \n                  .","journal-title":"Data Mining Knowl Dis"},{"issue":"4","key":"200_CR44","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10115-004-0182-5","volume":"7","author":"M-Y Lin","year":"2005","unstructured":"Lin M-Y, Lee S-Y. Efficient mining of sequential patterns with time constraints by delimited pattern growth. Knowl Inform Syst. 2005;7(4):499\u2013514. \n                    https:\/\/doi.org\/10.1007\/s10115-004-0182-5\n                    \n                  .","journal-title":"Knowl Inform Syst"},{"key":"200_CR45","doi-asserted-by":"publisher","unstructured":"Yang J, Yang C, Wei Y. Frequent pattern mining algorithm for uncertain data streams based on sliding window. In: 2016 8th international conference on intelligent human\u2013machine systems and cybernetics (IHMSC), vol. 02. 2016. p. 265\u20138. \n                    https:\/\/doi.org\/10.1109\/IHMSC.2016.293\n                    \n                  .","DOI":"10.1109\/IHMSC.2016.293"},{"issue":"12","key":"200_CR46","doi-asserted-by":"publisher","first-page":"2170","DOI":"10.1109\/TKDE.2011.165","volume":"24","author":"L Wang","year":"2012","unstructured":"Wang L, Cheung DWL, Cheng R, Lee SD, Yang XS. Efficient mining of frequent item sets on large uncertain databases. IEEE Trans Knowl Data Eng. 2012;24(12):2170\u201383. \n                    https:\/\/doi.org\/10.1109\/TKDE.2011.165\n                    \n                  .","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"200_CR47","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-18032-8_21","volume-title":"Advancs knowledge discovery and data mining","author":"J Ge","year":"2015","unstructured":"Ge J, Xia Y, Wang J. Towards efficient sequential pattern mining in temporal uncertain databases. In: Cao T, Lim E-P, Zhou Z-H, Ho T-B, Cheung D, Motoda H, editors. Advancs knowledge discovery and data mining. Cham: Springer; 2015. p. 268\u201379. \n                    https:\/\/doi.org\/10.1007\/978-3-319-18032-8_21\n                    \n                  ."},{"key":"200_CR48","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.future.2013.10.026","volume":"37","author":"A Cuzzocrea","year":"2014","unstructured":"Cuzzocrea A, Leung CK-S, MacKinnon RK. Mining constrained frequent itemsets from distributed uncertain data. Fut Gen Comput Syst. 2014;37:117\u201326. \n                    https:\/\/doi.org\/10.1016\/j.future.2013.10.026\n                    \n                  .","journal-title":"Fut Gen Comput Syst"},{"key":"200_CR49","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-13657-3_51","volume-title":"Advances in knowledge discovery and data mining","author":"T Calders","year":"2010","unstructured":"Calders T, Garboni C, Goethals B. Efficient pattern mining of uncertain data with sampling. In: Zaki MJ, Yu JX, Ravindran B, Pudi V, editors. Advances in knowledge discovery and data mining. Berlin: Springer; 2010. p. 480\u20137."},{"issue":"1","key":"200_CR50","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf RE. Depth-first iterative-deepening: an optimal admissible tree search. Artif Intell. 1985;27(1):97\u2013109. \n                    https:\/\/doi.org\/10.1016\/0004-3702(85)90084-0\n                    \n                  .","journal-title":"Artif Intell"},{"key":"200_CR51","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/B978-0-12-381479-1.00006-X","volume-title":"Data mining. The Morgan Kaufmann Series in data management systems","author":"J Han","year":"2012","unstructured":"Han J, Kamber M, Pei J. 6\u2014mining frequent patterns, associations, and correlations: basic concepts and methods. In: Han J, Kamber M, Pei J, editors. Data mining. The Morgan Kaufmann Series in data management systems. 3rd ed. Boston: Morgan Kaufmann; 2012. p. 243\u201378. \n                    https:\/\/doi.org\/10.1016\/B978-0-12-381479-1.00006-X\n                    \n                  .","edition":"3"},{"key":"200_CR52","unstructured":"Savasere A, Omiecinski E, Navathe SB. An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21th international conference on very large data bases. VLDB \u201995. San Francisco: Morgan Kaufmann Publishers Inc.; 1995. p. 432\u201344. \n                    http:\/\/dl.acm.org\/citation.cfm?id=645921.673300\n                    \n                  ."},{"key":"200_CR53","unstructured":"Orlando S, Lucchese C, Palmerini P, Perego R, Silvestri F. kDCI: a multi-strategy algorithm for mining frequent sets. In: FIMI. 2003."},{"key":"200_CR54","unstructured":"Toivonen H. Sampling large databases for association rules. In: Proceedings of the 22th international conference on Very large data bases. VLDB \u201996. San Francisco: Morgan Kaufmann Publishers Inc.; 1996. p. 134\u201345. \n                    http:\/\/dl.acm.org\/citation.cfm?id=645922.673325\n                    \n                  ."},{"issue":"2","key":"200_CR55","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/276305.276313","volume":"27","author":"RJ Bayardo Jr","year":"1998","unstructured":"Bayardo RJ Jr. Efficiently mining long patterns from databases. SIGMOD Rec. 1998;27(2):85\u201393. \n                    https:\/\/doi.org\/10.1145\/276305.276313\n                    \n                  .","journal-title":"SIGMOD Rec."},{"key":"200_CR56","unstructured":"Burdick D, Calimlim M, Gehrke J. Mafia: a maximal frequent itemset algorithm for transactional databases. In: Proceedings of the 17th international conference on data engineering. IEEE computer society, Washington, DC; 2001. p. 443\u201352. \n                    http:\/\/dl.acm.org\/citation.cfm?id=645484.656386\n                    \n                  ."},{"key":"200_CR57","first-page":"398","volume-title":"Lecture Notes in Computer Science","author":"Nicolas Pasquier","year":"1999","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L. Discovering frequent closed itemsets for association rules. In: Proceedings of the 7th international conference on database theory. ICDT \u201999. London: Springer; 1999. p. 398\u2013416. \n                    http:\/\/dl.acm.org\/citation.cfm?id=645503.656256\n                    \n                  ."},{"issue":"3","key":"200_CR58","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ. Scalable algorithms for association mining. IEEE Trans Knowl Data Eng. 2000;12(3):372\u201390. \n                    https:\/\/doi.org\/10.1109\/69.846291\n                    \n                  .","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"200_CR59","doi-asserted-by":"publisher","unstructured":"Zaki M.J, Gouda K. Fast vertical mining using diffsets. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201903; 2003. p. 326\u201335. \n                    https:\/\/doi.org\/10.1145\/956750.956788\n                    \n                  .","DOI":"10.1145\/956750.956788"},{"issue":"1","key":"200_CR60","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","volume":"24","author":"T-C Fu","year":"2011","unstructured":"Fu T-C. A review on time series data mining. Eng Appl Artif Intell. 2011;24(1):164\u201381. \n                    https:\/\/doi.org\/10.1016\/j.engappai.2010.09.007\n                    \n                  .","journal-title":"Eng Appl Artif Intell"},{"key":"200_CR61","volume-title":"The art of computer programming","author":"DE Knuth","year":"1998","unstructured":"Knuth DE. The art of computer programming, vol. 3. 2nd ed. Redwood City: Addison Wesley Longman Publishing Co., Inc.; 1998.","edition":"2"},{"key":"200_CR62","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-46131-1_8","volume-title":"Machine learning and knowledge discovery in databases","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger P, Lin JC-W, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT. The SPMF open-source data mining library version 2. In: Berendt B, Bringmann B, Fromont \u00c9, Garriga G, Miettinen P, Tatti N, Tresp V, editors. Machine learning and knowledge discovery in databases. Cham: Springer; 2016. p. 36\u201340."},{"key":"200_CR63","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-45408-X_8","volume-title":"Advances in Artificial Intelligence. PRICAI 2000 Workshop Reader","author":"Wim Pijls","year":"2001","unstructured":"Pijls W, Potharst R. Classification based upon frequent patterns. In: Kowalczyk R, Loke SW, Reed NE, Williams GJ, editors. Advances in artificial intelligence. PRICAI 2000 workshop reader. Berlin: Springer; 2001. p. 72\u20139."},{"key":"200_CR64","first-page":"1677","volume":"41","author":"P Wang","year":"2004","unstructured":"Wang P, Wu X-C, Wang C, Wang W, Shi B-L. CAPE\u2014a classification algorithm using frequent patterns over data streams. J Comput Res Develop. 2004;41:1677\u201383.","journal-title":"J Comput Res Develop"},{"key":"200_CR65","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-319-07821-2_16","volume-title":"Frequent Pattern Mining","author":"Arthur Zimek","year":"2014","unstructured":"Zimek A, Assent I, Vreeken J. In: Aggarwal CC, Han J, editors. Frequent pattern mining algorithms for data clustering. Cham: Springer. 2014. p. 403\u201323. \n                    https:\/\/doi.org\/10.1007\/978-3-319-07821-2_16\n                    \n                  ."},{"key":"200_CR66","doi-asserted-by":"publisher","first-page":"2184","DOI":"10.3390\/app8112184","volume":"8","author":"S Rezig","year":"2018","unstructured":"Rezig S, Achour Z, Rezg N. Using data mining methods for predicting sequential maintenance activities. Appl Sci. 2018;8:2184. \n                    https:\/\/doi.org\/10.3390\/app8112184\n                    \n                  .","journal-title":"Appl Sci"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-019-0200-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-019-0200-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-019-0200-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T23:05:03Z","timestamp":1589238303000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-019-0200-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1186\/s40537-019-0200-9","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"17 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"37"}}