{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:05:48Z","timestamp":1726409148400},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319258393"},{"type":"electronic","value":"9783319258409"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25840-9_1","type":"book-chapter","created":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T16:51:09Z","timestamp":1445964669000},"page":"3-18","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Discovery of Episode Rules with a Minimal Antecedent and a Distant Consequent"],"prefix":"10.1007","author":[{"given":"Lina","family":"Fahed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armelle","family":"Brun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Boyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,28]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.datak.2013.06.005","volume":"87","author":"A Achar","year":"2013","unstructured":"Achar, A., Sastry, P., et al.: Pattern-growth based frequent serial episode discovery. Data Knowl. Eng. 87, 91\u2013108 (2013)","journal-title":"Data Knowl. Eng."},{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207\u2013216. ACM (1993)","key":"1_CR2","DOI":"10.1145\/170036.170072"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00778-010-0197-3","volume":"20","author":"CW Cho","year":"2011","unstructured":"Cho, C.W., Wu, Y.H., Yen, S.J., Zheng, Y., Chen, A.L.: On-line rule matching for event prediction. VLDB J. 20(3), 303\u2013334 (2011)","journal-title":"VLDB J."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-22589-5_8","volume-title":"Modeling Decision for Artificial Intelligence","author":"M Gan","year":"2011","unstructured":"Gan, M., Dai, H.: Fast mining of non-derivable episode rules in complex sequences. In: Torra, V., Narakawa, Y., Yin, J., Long, J. (eds.) MDAI 2011. LNCS, vol. 6820, pp. 67\u201378. Springer, Heidelberg (2011)"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.is.2007.07.003","volume":"33","author":"KY Huang","year":"2008","unstructured":"Huang, K.Y., Chang, C.H.: Efficient mining of frequent episodes from complex sequences. Inf. Syst. 33(1), 96\u2013114 (2008)","journal-title":"Inf. Syst."},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF02719780","volume":"31","author":"S Laxman","year":"2006","unstructured":"Laxman, S., Sastry, P.S.: A survey of temporal data mining. Sadhana 31(2), 173\u2013198 (2006)","journal-title":"Sadhana"},{"doi-asserted-by":"crossref","unstructured":"Laxman, S., Sastry, P., Unnikrishnan, K.: A fast algorithm for finding frequent episodes in event streams. In: 13th ACM SIGKDD. ACM (2007)","key":"1_CR7","DOI":"10.1145\/1281192.1281238"},{"issue":"8","key":"1_CR8","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1002\/1098-111X(200008)15:8<687::AID-INT1>3.0.CO;2-X","volume":"15","author":"J Luo","year":"2000","unstructured":"Luo, J., Bridges, S.M.: Mining fuzzy association rules and fuzzy frequency episodes for intrusion detection. Int. J. Intell. Syst. 15(8), 687\u2013703 (2000)","journal-title":"Int. J. Intell. Syst."},{"issue":"3","key":"1_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, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 1(3), 259\u2013289 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-30116-5_30","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"N M\u00e9ger","year":"2004","unstructured":"M\u00e9ger, N., Rigotti, C.: Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 313\u2013324. Springer, Heidelberg (2004)"},{"issue":"2","key":"1_CR11","first-page":"108","volume":"1","author":"S Neeraj","year":"2012","unstructured":"Neeraj, S., Swati, L.S.: Overview of non-redundant association rule mining. Res. J. Recent Sci. 1(2), 108\u2013112 (2012). ISSN 2277-2502","journal-title":"Res. J. Recent Sci."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-36175-8_4","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A Ng","year":"2003","unstructured":"Ng, A., Fu, A.W.: Mining frequent episodes for relating financial events and stock trends. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS, vol. 2637, pp. 27\u201339. Springer, Heidelberg (2003)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT 1999","author":"N Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"unstructured":"Rahal, I., Ren, D., Wu, W., Perrizo, W.: Mining confident minimal rules with fixed-consequents. In: 16th IEEE ICTAI 2004 (2004)","key":"1_CR14"}],"container-title":["Communications in Computer and Information Science","Knowledge Discovery, Knowledge Engineering and Knowledge Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25840-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T05:59:47Z","timestamp":1559282387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25840-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319258393","9783319258409"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25840-9_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}