{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:07:37Z","timestamp":1744171657290,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334856"},{"type":"electronic","value":"9783642334863"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33486-3_28","type":"book-chapter","created":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T16:39:17Z","timestamp":1347295157000},"page":"435-450","source":"Crossref","is-referenced-by-count":1,"title":["General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations"],"prefix":"10.1007","author":[{"given":"Tomohiro","family":"I","sequence":"first","affiliation":[]},{"given":"Yuki","family":"Enokuma","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE, pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"28_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-78197-4_29","volume-title":"New Frontiers in Artificial Intelligence","author":"H. Arimura","year":"2008","unstructured":"Arimura, H., Uno, T.: Mining Maximal Flexible Patterns in a Sequence. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol.\u00a04914, pp. 307\u2013317. Springer, Heidelberg (2008)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: KDD, pp. 429\u2013435 (2002)","DOI":"10.1145\/775047.775109"},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. J. ACM\u00a034(3), 578\u2013595 (1987)","journal-title":"J. ACM"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Ding, B., Lo, D., Han, J., Khoo, S.-C.: Efficient mining of closed repetitive gapped subsequences from a sequence database. In: ICDE, pp. 1024\u20131035 (2009)","DOI":"10.1109\/ICDE.2009.104"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Lo, D., Cheng, H.: Lucia: Mining closed discriminative dyadic sequential patterns. In: EDBT, pp. 21\u201332 (2011)","DOI":"10.1145\/1951365.1951371"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Lo, D., Ding, B., Lucia, Han, J.: Bidirectional mining of non-redundant recurrent rules from a sequence database. In: ICDE, pp. 1043\u20131054 (2011)","DOI":"10.1109\/ICDE.2011.5767848"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Lo, D., Khoo, S.C., Li, J.: Mining and ranking generators of sequential patterns. In: SDM, pp. 553\u2013564 (2008)","DOI":"10.1137\/1.9781611972788.51"},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, I.A.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery\u00a01(3), 259\u2013289 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"28_CR10","unstructured":"Parida, L., Rigoutsos, I., Floratos, A., Platt, D.E., Gao, Y.: Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm. In: Proc. SODA, pp. 297\u2013308 (2000)"},{"key":"28_CR11","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Prefixspan: Mining sequential patterns by prefix-projected growth. In: ICDE, pp. 215\u2013224 (2001)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-540-45138-9_56","volume-title":"Mathematical Foundations of Computer Science 2003","author":"N. Pisanti","year":"2003","unstructured":"Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 622\u2013631. Springer, Heidelberg (2003)"},{"key":"28_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-87479-9_17","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"C. Ra\u00efssi","year":"2008","unstructured":"Ra\u00efssi, C., Calders, T., Poncelet, P.: Mining Conjunctive Sequential Patterns. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol.\u00a05211, p. 19. Springer, Heidelberg (2008)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Advances in Database Technology EDBT \u201996","author":"R. Srikant","year":"1996","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. 3\u201317. Springer, Heidelberg (1996)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Tatti, N., Cule, B.: Mining closed strict episodes. In: ICDM, pp. 501\u2013510 (2010)","DOI":"10.1109\/ICDM.2010.89"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J.: BIDE: Efficient mining of frequent closed sequences. In: ICDE, pp. 79\u201390 (2004)","DOI":"10.1109\/ICDE.2004.1319986"},{"issue":"8","key":"28_CR17","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 Transactions on Knowledge and Data Engineering\u00a019(8), 1042\u20131056 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Wang, K., Xu, Y., Yu, J.X.: Scalable sequential pattern mining for biological sequences. In: CIKM, pp. 178\u2013187 (2004)","DOI":"10.1145\/1031171.1031209"},{"issue":"3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"2098","DOI":"10.1016\/j.eswa.2009.06.064","volume":"37","author":"H.-W. Wu","year":"2010","unstructured":"Wu, H.-W., Lee, A.J.T.: Mining closed flexible patterns in time-series databases. Expert Systems with Applications\u00a037(3), 2098 (2010)","journal-title":"Expert Systems with Applications"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: Mining closed sequential patterns in large databases. In: SDM (2003)","DOI":"10.1137\/1.9781611972733.15"},{"issue":"1\/2","key":"28_CR21","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\/2), 31\u201360 (2001)","journal-title":"Machine Learning"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-13657-3_34","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"W. Zhou","year":"2010","unstructured":"Zhou, W., Liu, H., Cheng, H.: Mining Closed Episodes from Event Sequences Efficiently. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part I. LNCS, vol.\u00a06118, pp. 310\u2013318. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33486-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T04:32:42Z","timestamp":1744086762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33486-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334856","9783642334863"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33486-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}