{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T10:40:10Z","timestamp":1736073610192,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292449"},{"type":"electronic","value":"9783540316657"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11564126_61","type":"book-chapter","created":{"date-parts":[[2005,11,4]],"date-time":"2005-11-04T10:24:55Z","timestamp":1131099895000},"page":"585-592","source":"Crossref","is-referenced-by-count":0,"title":["An Entropy-Based Approach for Generating Multi-dimensional Sequential Patterns"],"prefix":"10.1007","author":[{"given":"Chang-Hwan","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. Int. Conf. on Data Engineering, 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"61_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1214\/aos\/1176343842","volume":"5","author":"R.J. Beran","year":"1977","unstructured":"Beran, R.J.: Minimum hellinger distances for parametric models. Ann. Statistics\u00a05, 445\u2013463 (1977)","journal-title":"Ann. Statistics"},{"key":"61_CR3","unstructured":"Pei, J., Wang, K., Chen, Q., Pinto, H., Han, J., Dayal, U.: Multi-dimensional sequential pattern mining. In: Int. Conf. on Information and Knowledge Management (2001)"},{"key":"61_CR4","unstructured":"Mortazavi-Asl, B., Chen, Q., Dayal, U., Han, J., Pei, J., Hsu, M.-C.: Freespan: Frequent pattern-projected sequential pattern mining. In: Int. Conf. Knowledge Discovery and Data Mining, KDD 2000 (2000)"},{"key":"61_CR5","unstructured":"Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Pei, J., Han, J., Hsu, M.-C.: Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: Int. Conf. on Data Engineering (2001)"},{"key":"61_CR6","unstructured":"Rastogi, R., Garofalaskis, M., Shim, K.: Spirit:sequential pattern mining with regular expression constraints. In: Int. Conf. on Very Large Databases (1999)"},{"key":"61_CR7","unstructured":"Han, J., Tzvetkov, P., Yan, X.: Tsp: Mining top-k closed sequential patterns. In: Int. Conf. on Data Mining (2003)"},{"key":"61_CR8","unstructured":"Afshar, R., Yan, X., Han, J.: Clospan: Mining closed sequential patterns in large databases. In: Int. Conf. on Data Mining (2003)"},{"key":"61_CR9","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, 31\u201360 (2001)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564126_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T10:01:53Z","timestamp":1736071313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564126_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292449","9783540316657"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11564126_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}