{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T22:56:41Z","timestamp":1781650601934,"version":"3.54.5"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1016\/j.future.2019.11.008","type":"journal-article","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T11:59:17Z","timestamp":1573819157000},"page":"849-863","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Mining the frequency of time-constrained serial episodes over massive data sequences and streams"],"prefix":"10.1016","volume":"110","author":[{"given":"Hui","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhe","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sizhe","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingjing","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chia Emmanuel","family":"Tungom","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.future.2019.11.008_b1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1009748302351","article-title":"Discovery of frequent episodes in event sequences","volume":"1","author":"Mannila","year":"1997","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.future.2019.11.008_b2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.datak.2013.06.005","article-title":"Pattern-growth based frequent serial episode discovery","volume":"87","author":"Achar","year":"2013","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.future.2019.11.008_b3","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.future.2018.03.004","article-title":"Filtering irrelevant sequential data out of game session telemetry though similarity collapses","volume":"84","author":"Kohwalter","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.11.008_b4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.future.2017.02.049","article-title":"A hybrid knowledge-based recommender system for e-learning based on ontology and sequential pattern mining","volume":"72","author":"Tarus","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"10.1016\/j.future.2019.11.008_b5","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.future.2011.10.009","article-title":"Bacteria foraging optimization for protein sequence analysis on the grid","volume":"28","author":"Vivekanandan","year":"2012","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.11.008_b6","series-title":"EISIC","first-page":"107","article-title":"Data mining applications for fraud detection in securities market","author":"Golmohammadi","year":"2012"},{"key":"10.1016\/j.future.2019.11.008_b7","article-title":"A web based nucleotide sequencing tool using blast algorithm","volume":"18","author":"Saha","year":"2016","journal-title":"Int. J. Biotech Trends Technol."},{"key":"10.1016\/j.future.2019.11.008_b8","doi-asserted-by":"crossref","unstructured":"X. Fu, L. Shi, J. Li, Balanced parallel frequent pattern mining over massive data stream, in: Third IEEE International Conference on Big Data Computing Service and Applications, BigDataService 2017, Redwood City, CA, USA, April 6-9, 2017, pp. 50\u201359.","DOI":"10.1109\/BigDataService.2017.15"},{"key":"10.1016\/j.future.2019.11.008_b9","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.future.2018.06.042","article-title":"CPS data streams analytics based on machine learning for cloud and fog computing: A survey","volume":"90","author":"Fei","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.11.008_b10","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.future.2018.04.094","article-title":"Distributed nearest neighbor classification for large-scale multi-label data on spark","volume":"87","author":"Gonzalez-Lopez","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.11.008_b11","series-title":"Online analysis of dynamic streaming data","author":"Kuehn","year":"2018"},{"key":"10.1016\/j.future.2019.11.008_b12","series-title":"ICDE","first-page":"83","article-title":"Mining precise-positioning episode rules from event sequences","author":"Ao","year":"2017"},{"key":"10.1016\/j.future.2019.11.008_b13","doi-asserted-by":"crossref","first-page":"5037","DOI":"10.1109\/ACCESS.2017.2776358","article-title":"Pargen: A parallel method for partitioning data stream applications in mobile edge computing","volume":"6","author":"Wen","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.future.2019.11.008_b14","series-title":"ICDE","first-page":"3","article-title":"Mining sequential patterns","author":"Agrawal","year":"1995"},{"key":"10.1016\/j.future.2019.11.008_b15","series-title":"KDD","first-page":"735","article-title":"Keeping it short and simple: Summarising complex event sequences with multivariate patterns","author":"Bertens","year":"2016"},{"issue":"2","key":"10.1016\/j.future.2019.11.008_b16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2431211.2431218","article-title":"Sequential pattern mining - approaches and algorithms","volume":"45","author":"Mooney","year":"2013","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.future.2019.11.008_b17","series-title":"ICDE","first-page":"215","article-title":"Prefixspan: Mining sequential patterns by prefix-projected growth","author":"Pei","year":"2001"},{"issue":"3","key":"10.1016\/j.future.2019.11.008_b18","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10115-006-0038-2","article-title":"Mining minimal distinguishing subsequence patterns with gap constraints","volume":"11","author":"Ji","year":"2007","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.future.2019.11.008_b19","series-title":"KDD","first-page":"410","article-title":"A fast algorithm for finding frequent episodes in event streams","author":"Laxman","year":"2007"},{"key":"10.1016\/j.future.2019.11.008_b20","series-title":"SDM","first-page":"166","article-title":"Clospan: Mining closed sequential patterns in large databases","author":"Yan","year":"2003"},{"key":"10.1016\/j.future.2019.11.008_b21","series-title":"ICDM","first-page":"605","article-title":"Efficient episode mining of dynamic event streams","author":"Patnaik","year":"2012"},{"key":"10.1016\/j.future.2019.11.008_b22","series-title":"Models for supervised learning in sequence data","author":"Pei","year":"2018"},{"issue":"2","key":"10.1016\/j.future.2019.11.008_b23","doi-asserted-by":"crossref","DOI":"10.1145\/1267066.1267068","article-title":"Mining periodic patterns with gap requirement from sequences","volume":"1","author":"Zhang","year":"2007","journal-title":"TKDD"},{"key":"10.1016\/j.future.2019.11.008_b24","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.compeleceng.2017.03.009","article-title":"Applying spark based machine learning model on streaming big data for health status prediction","volume":"65","author":"Nair","year":"2018","journal-title":"Comput. Electr. Eng."},{"key":"10.1016\/j.future.2019.11.008_b25","doi-asserted-by":"crossref","first-page":"6487","DOI":"10.1109\/ACCESS.2018.2797159","article-title":"A differentially private unscented kalman filter for streaming data in iot","volume":"6","author":"Wang","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.future.2019.11.008_b26","series-title":"ICDE","first-page":"891","article-title":"Online frequent episode mining","author":"Ao","year":"2015"},{"key":"10.1016\/j.future.2019.11.008_b27","series-title":"SIGMOD","first-page":"407","article-title":"High-performance complex event processing over streams","author":"Wu","year":"2006"},{"key":"10.1016\/j.future.2019.11.008_b28","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.ins.2019.07.098","article-title":"Counting the frequency of time-constrained serial episodes in a streaming sequence","volume":"505","author":"Li","year":"2019","journal-title":"Inform. Sci."},{"key":"10.1016\/j.future.2019.11.008_b29","doi-asserted-by":"crossref","unstructured":"Y. Gong, R.O. Sinnott, P. Rimba, RT-DBSCAN: real-time parallel clustering of spatio-temporal data using spark-streaming, in: Computational Science - ICCS 2018 - 18th International Conference, Wuxi, China, June 11-13, 2018, Proceedings, Part I, pp. 524\u2013539.","DOI":"10.1007\/978-3-319-93698-7_40"},{"key":"10.1016\/j.future.2019.11.008_b30","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.future.2016.06.027","article-title":"An intermediate data placement algorithm for load balancing in spark computing environment","volume":"78","author":"Tang","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"issue":"14","key":"10.1016\/j.future.2019.11.008_b31","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.4429","article-title":"A speculative parallel simulated annealing algorithm based on apache spark","volume":"30","author":"Wang","year":"2018","journal-title":"Concurr. Comput.: Pract. Exper."},{"issue":"3","key":"10.1016\/j.future.2019.11.008_b32","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10723-017-9404-4","article-title":"A parallel conditional random fields model based on spark computing environment","volume":"15","author":"Tang","year":"2017","journal-title":"J. Grid Comput."},{"key":"10.1016\/j.future.2019.11.008_b33","series-title":"SIGMOD","first-page":"217","article-title":"On complexity and optimization of expensive queries in complex event processing","author":"Zhang","year":"2014"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X18332138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X18332138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T04:24:32Z","timestamp":1759119872000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X18332138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":33,"alternative-id":["S0167739X18332138"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2019.11.008","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mining the frequency of time-constrained serial episodes over massive data sequences and streams","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2019.11.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}