{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:29Z","timestamp":1725488549725},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415978"},{"type":"electronic","value":"9783540445654"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44565-x_8","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T05:48:14Z","timestamp":1186811294000},"page":"162-187","source":"Crossref","is-referenced-by-count":2,"title":["Sequence Mining in Categorical Domains: Algorithms and Applications"],"prefix":"10.1007","author":[{"given":"Mohammed J.","family":"Zaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,7]]},"reference":[{"key":"8_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A. I. (1996). Fast discovery of association rules. In Fayyad, U. and et al, editors, Advances in Knowledge Discovery and Data Mining, pages 307\u2013328. AAAI Press, Menlo Park, CA."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R. and Srikant, R. (1995). Mining sequential patterns. In 11th Intl. Conf. on Data Engg.","DOI":"10.1109\/ICDE.1995.380415"},{"key":"8_CR3","unstructured":"Duda, R. O. and Hart, P. E. (1973). Pattern Classification and Scene Analysis. John Wiley and Sons."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Hatonen, K., Klemettinen, M., Mannila, H., Ronkainen, P., and Toivonen, H. (1996). Knowledge discovery from telecommunication network alarm databases. In 12th Intl. Conf. Data Engineering.","DOI":"10.1109\/ICDE.1996.492095"},{"key":"8_CR5","unstructured":"IBM. \n                    \n                      http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html\n                    \n                    \n                  . Quest Data Mining Project, IBM Almaden Research Center, San Jose, CA 95120"},{"key":"8_CR6","unstructured":"Lesh, N., Martin, N., and Allen, J. (1998). Improving big plans. In 15th Nat. Conf. AI."},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/5254.850827","volume":"15","author":"N. Lesh","year":"2000","unstructured":"Lesh, N., Zaki, M. J., and Ogihara, M. (2000). Scalable feature mining for sequential data. IEEE Intelligent Systems and their Applications, 15(2):48\u201356. Special issue on Data Mining.","journal-title":"IEEE Intelligent Systems and their Applications"},{"key":"8_CR8","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285\u2013318.","journal-title":"Machine Learning"},{"key":"8_CR9","unstructured":"Mannila, H. and Toivonen, H. (1996). Discovering generalized episodes using minimal occurences. In 2nd Intl. Conf. Knowledge Discovery and Data Mining."},{"key":"8_CR10","unstructured":"Mannila, H., Toivonen, H., and Verkamo, I. (1995). Discovering frequent episodes in sequences. In 1st Intl. Conf. Knowledge Discovery and Data Mining."},{"key":"8_CR11","unstructured":"Oates, T., Schmill, M. D., Jensen, D., and Cohen, P. R. (1997). A family of algorithms for finding temporal structure in data. In 6th Intl. Workshop on AI and Statistics."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Srikant, R. and Agrawal, R. (1996). Mining sequential patterns: Generalizations and performance improvements. In 5th Intl. Conf. Extending Database Technology.","DOI":"10.1007\/BFb0014140"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Zaki, M. J. (1998). Efficient enumeration of frequent sequences. In 7th Intl. Conf. on Information and Knowledge Management.","DOI":"10.1145\/288627.288643"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"M. J. Zaki","year":"1999","unstructured":"Zaki, M. J. (1999). Parallel and distributed association mining: A survey. IEEE Concurrency, 7(4):14\u201325. Special issue on Parallel Data Mining.","journal-title":"IEEE Concurrency"},{"key":"8_CR15","unstructured":"Zaki, M. J., Lesh, N., and Ogihara, M. (1998). PLANMINE: Sequence mining for plan failures. In 4th Intl. Conf. Knowledge Discovery and Data Mining."},{"key":"8_CR16","unstructured":"Zaki, M. J., Parthasarathy, S., Ogihara, M., and Li, W. (1997). New algorithms for fast discovery of association rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining."}],"container-title":["Lecture Notes in Computer Science","Sequence Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44565-X_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T12:49:57Z","timestamp":1550753397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44565-X_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540415978","9783540445654"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44565-x_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}