{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:17:57Z","timestamp":1725560277689},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285588"},{"type":"electronic","value":"9783540317326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546849_45","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:57:55Z","timestamp":1127829475000},"page":"458-467","source":"Crossref","is-referenced-by-count":2,"title":["A General Effective Framework for Monotony and Tough Constraint Based Sequential Pattern Mining"],"prefix":"10.1007","author":[{"given":"Enhong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongshu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phillip C-y","family":"Sheu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Proc.5th Int. Conf. Extending Database Technology (EDBT 1996)","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":"45_CR2","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efiicient enumeration of frequent sequences. In: 7th Intl. Conf. Info. and Knowledge Management (November 1998)","DOI":"10.1145\/288627.288643"},{"key":"45_CR3","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In: Proc. 2001 Int. Conf. Data Engineering (ICDE 2001), Heidelberg, Germany, April 2001, pp. 215\u2013224 (2001)"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J., Wang, W.: Mining Sequential Patterns with Constraints in Large Databases. In: Proc. of the 2002 ACM CIKM Conference (2002)","DOI":"10.1145\/584792.584799"},{"key":"45_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-39804-2_8","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAnte: Anticipated Data Reduction in Constrained Patterns Mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 59\u201370. Springer, Heidelberg (2003)"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Sequence mining in categorical domains: incorporating constraints. In: Conference on Information and Knowledge Management (2000)","DOI":"10.1145\/354756.354849"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Orlando, S., Perego, R., Silvestri, C.: A new algorithm for gap constrained sequence mining. Symposium on Applied Computing (2004)","DOI":"10.1145\/967900.968014"},{"key":"45_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-39804-2_7","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Adaptive constraint pushing in frequent pattern mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 47\u201358. Springer, Heidelberg (2003)"},{"key":"45_CR9","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithm for Mining Association Rules. In: Proc. 21st Int. Conf. on Very Large Data Bases (VLDB), Zurich, Switzerland, pp. 432\u2013443 (1995)"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546849_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:07Z","timestamp":1605642007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546849_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285588","9783540317326"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11546849_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}