{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T11:59:29Z","timestamp":1763639969471,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303524"},{"type":"electronic","value":"9783642303531"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30353-1_27","type":"book-chapter","created":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T09:44:29Z","timestamp":1337939069000},"page":"299-304","source":"Crossref","is-referenced-by-count":23,"title":["Mining Sequential Rules Common to Several Sequences with the Window Size Constraint"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Fournier-Viger","sequence":"first","affiliation":[]},{"given":"Cheng-Wei","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Vincent S.","family":"Tseng","sequence":"additional","affiliation":[]},{"given":"Roger","family":"Nkambou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF02719780","volume":"3","author":"S. Laxman","year":"2006","unstructured":"Laxman, S., Sastry, P.: A survey of temporal data mining. Sadhana\u00a03, 173\u2013198 (2006)","journal-title":"Sadhana"},{"issue":"1\/2","key":"27_CR2","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"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.knosys.2011.07.005","volume":"25","author":"P. Fournier-Viger","year":"2012","unstructured":"Fournier-Viger, P., Faghihi, U., Nkambou, R., Mephu Nguifo, E.: CMRules: An Efficient Algorithm for Mining Sequential Rules Common to Several Sequences. Knowledge Based Systems\u00a025(1), 63\u201376 (2012)","journal-title":"Knowledge Based Systems"},{"key":"27_CR4","unstructured":"Das., G., Lin, K.-I., Mannila, H., Renganathan, G., Smyth, P.: Rule Discovery from Time Series. In: Proc. ACM SIGKDD 1998, pp. 16\u201322. ACM Press (1998)"},{"key":"27_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11548706_11","volume-title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","author":"J.S. Deogun","year":"2005","unstructured":"Deogun, J.S., Jiang, L.: Prediction Mining \u2013 An Approach to Mining Association Rules for Prediction. In: \u015al\u0119zak, D., Yao, J., Peters, J.F., Ziarko, W.P., Hu, X. (eds.) RSFDGrC 2005. LNCS (LNAI), vol.\u00a03642, pp. 98\u2013108. Springer, Heidelberg (2005)"},{"issue":"4-5","key":"27_CR6","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.is.2009.01.002","volume":"34","author":"D. Lo","year":"2009","unstructured":"Lo, D., Khoo, S.-C., Wong, L.: Non-redundant sequential rules \u2013 Theory and algorithm. Inform. Systems\u00a034(4-5), 438\u2013453 (2009)","journal-title":"Inform. Systems"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkano, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery\u00a01(1), 259\u2013289 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Nkambou, R., Tseng, V.S.: RuleGrowth: Mining Sequential Rules Common to Several Sequences by Pattern-Growth. In: Proc. SAC 2011, pp. 954-959 (2011)","DOI":"10.1145\/1982185.1982394"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30353-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:52:56Z","timestamp":1558299176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30353-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303524","9783642303531"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30353-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}