{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T04:03:10Z","timestamp":1746504190756,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"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-12568-8_58","type":"book-chapter","created":{"date-parts":[[2014,10,23]],"date-time":"2014-10-23T21:38:58Z","timestamp":1414100338000},"page":"470-477","source":"Crossref","is-referenced-by-count":1,"title":["SPaMi-FTS: An Efficient Algorithm for Mining Frequent Sequential Patterns"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Kadir","family":"Febrer-Hern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Hern\u00e1ndez-Palancar","sequence":"additional","affiliation":[]},{"given":"Raudel","family":"Hern\u00e1ndez-Le\u00f3n","sequence":"additional","affiliation":[]},{"given":"Claudia","family":"Feregrino-Uribe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Agrawal, R., Srikant, R. (eds.) Proceedings of 1995 International Conference Data Engineering, ICDE 1995, pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-26007-0_80","volume":"137","author":"X. Yu","year":"2012","unstructured":"Yu, X., Li, M., Gyu Lee, D., Deuk Kim, K., Ho Ryu, K.: Application of Closed Gap-Constrained Sequential Pattern Mining in Web Log Data. Advances in Control and Communication\u00a0137, 649\u2013656 (2012)","journal-title":"Advances in Control and Communication"},{"key":"58_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-540-30463-0_60","volume-title":"Progress in Pattern Recognition, Image Analysis and Applications","author":"R.A. Garc\u00eda-Hern\u00e1ndez","year":"2004","unstructured":"Garc\u00eda-Hern\u00e1ndez, R.A., Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A.: A fast algorithm to find all the maximal frequent sequences in a text. In: Sanfeliu, A., Mart\u00ednez Trinidad, J.F., Carrasco Ochoa, J.A. (eds.) CIARP 2004. LNCS, vol.\u00a03287, pp. 478\u2013486. Springer, Heidelberg (2004)"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Liao, V.C.-C., Chen, M.S.: An Efficient Sequential Pattern Mining Algorithm for Motifs with Gap Constraints. In: Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), vol.\u00a01, pp. 1\u20131 (2012)","DOI":"10.1109\/BIBM.2012.6392660"},{"key":"58_CR5","unstructured":"Garofalakis, M., Rastogi, R., Shim, K.: SPIRIT: Sequential Pattern Mining with Regular Expression Constraints. In: Proceedings of the 25th International Conference on Very Large Data Bases, pp. 223\u2013234 (1999)"},{"key":"58_CR6","unstructured":"Pei, J., Han, J., Mortazavi-asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth, pp. 215\u2013224 (2001)"},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol.\u00a01057, pp. 1\u201317. Springer, Heidelberg (1996)","DOI":"10.1007\/BFb0014140"},{"key":"58_CR8","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 Journal\u00a042, 31\u201360 (2001)","journal-title":"Machine Learning Journal"},{"key":"58_CR9","doi-asserted-by":"crossref","unstructured":"Ying Hsieh, C., Lin Yang, D., Wu, J.: An Efficient Sequential Pattern Mining Algorithm Based on the 2-Sequence Matrix. In: IEEE International Conference on Data Mining Workshops, pp. 583\u2013591 (2008)","DOI":"10.1109\/ICDMW.2008.82"},{"key":"58_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.jcss.2009.05.008","volume":"76","author":"K. Gouda","year":"2010","unstructured":"Gouda, K., Hassaan, M., Zaki, M.J.: PRISM: A Prime-Encoding Approach for Frequent Sequence Mining. Journal of Computer and System Sciences\u00a076, 88\u2013102 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Yang, Z., Wang, Y., Kitsuregawa, M.: LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases, pp. 1020\u20131023 (2007)","DOI":"10.1007\/978-3-540-71703-4_95"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12568-8_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T12:11:20Z","timestamp":1746447080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12568-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12568-8_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}