{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T15:22:58Z","timestamp":1783351378795,"version":"3.54.6"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319064826","type":"print"},{"value":"9783319064833","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06483-3_8","type":"book-chapter","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T13:07:57Z","timestamp":1398863277000},"page":"83-94","source":"Crossref","is-referenced-by-count":52,"title":["VMSP: Efficient Vertical Mining of Maximal Sequential Patterns"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Fournier-Viger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng-Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Gomariz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent S.","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Ramakrishnan, S.: Mining sequential patterns. In: Proc. 11th Intern. Conf. Data Engineering, pp. 3\u201314. IEEE (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: Proc. 8th ACM Intern. Conf. Knowl. Discov. Data Mining, pp. 429\u2013435. ACM (2002)","DOI":"10.1145\/775047.775109"},{"key":"8_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-53914-5_15","volume-title":"Advanced Data Mining and Applications","author":"P. Fournier-Viger","year":"2013","unstructured":"Fournier-Viger, P., Wu, C.-W., Tseng, V.S.: Mining Maximal Sequential Patterns without Candidate Maintenance. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds.) ADMA 2013, Part I. LNCS (LNAI), vol.\u00a08346, pp. 169\u2013180. Springer, Heidelberg (2013)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Gomariz, A., Campos, M., Thomas, R.: Fast Vertical Sequential Pattern Mining Using Co-occurrence Information. In: Proc. 18th Pacific-Asia Conference on Knowledge Discovery and Data Mining. LNCS (LNAI). Springer (2014)","DOI":"10.1007\/978-3-319-06608-0_4"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/11671299_53","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"R.A. Garc\u00eda-Hern\u00e1ndez","year":"2006","unstructured":"Garc\u00eda-Hern\u00e1ndez, R.A., Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A.: A new algorithm for fast discovery of maximal sequential patterns in a document collection. In: Gelbukh, A. (ed.) CICLing 2006. LNCS, vol.\u00a03878, pp. 514\u2013523. Springer, Heidelberg (2006)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-37453-1_5","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A. Gomariz","year":"2013","unstructured":"Gomariz, A., Campos, M., Marin, R., Goethals, B.: ClaSP: An Efficient Algorithm for Mining Frequent Closed Sequences. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS, vol.\u00a07818, pp. 50\u201361. Springer, Heidelberg (2013)"},{"key":"8_CR7","unstructured":"Guan, E.-Z., Chang, X.-Y., Wang, Z., Zhou, C.-G.: Mining Maximal Sequential Patterns. In: Proc. 2nd Intern. Conf. Neural Networks and Brain, pp. 525\u2013528 (2005)"},{"key":"8_CR8","unstructured":"Lin, N.P., Hao, W.-H., Chen, H.-J., Chueh, H.-E., Chang, C.-I.: Fast Mining Maximal Sequential Patterns. In: Proc. of the 7th Intern. Conf. on Simulation, Modeling and Optimization, Beijing, China, September 15-17, pp. 405\u2013408 (2007)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Luo, C., Chung, S.: Efficient mining of maximal sequential patterns using multiple samples. In: Proc. 5th SIAM Intern. Conf. Data Mining, Newport Beach, CA (2005)","DOI":"10.1137\/1.9781611972757.37"},{"key":"8_CR10","unstructured":"Lu, S., Li, C.: Apriori Adjust: An Efficient Algorithm for Discovering the Maximum Sequential Patterns. In: Proc. Intern. Workshop Knowl. Grid and Grid Intell. (2004)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824795.1824798","volume":"43","author":"N.R. Mabroukeh","year":"2010","unstructured":"Mabroukeh, N.R., Ezeife, C.I.: A taxonomy of sequential pattern mining algorithms. ACM Computing Surveys\u00a043(1), 1\u201341 (2010)","journal-title":"ACM Computing Surveys"},{"issue":"11","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J. Pei","year":"2004","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Mining sequential patterns by pattern-growth: the PrefixSpan approach. IEEE Trans. Known. Data Engin.\u00a016(11), 1424\u20131440 (2004)","journal-title":"IEEE Trans. Known. Data Engin."},{"issue":"8","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/TKDE.2007.1043","volume":"19","author":"J. Wang","year":"2007","unstructured":"Wang, J., Han, J., Li, C.: Frequent closed sequence mining without candidate maintenance. IEEE Trans. on Knowledge Data Engineering\u00a019(8), 1042\u20131056 (2007)","journal-title":"IEEE Trans. on Knowledge Data Engineering"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"M.J. Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: An efficient algorithm for mining frequent sequences. Machine Learning\u00a042(1), 31\u201360 (2001)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06483-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T16:38:23Z","timestamp":1746203903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06483-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319064826","9783319064833"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06483-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}