{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:58:51Z","timestamp":1744163931211},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332060"},{"type":"electronic","value":"9783540332077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11731139_49","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T04:03:44Z","timestamp":1141877024000},"page":"425-434","source":"Crossref","is-referenced-by-count":13,"title":["Mining Temporal Indirect Associations"],"prefix":"10.1007","author":[{"given":"Ling","family":"Chen","sequence":"first","affiliation":[]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[]},{"given":"Jinyan","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of ACM SIGMOD (1993)","DOI":"10.1145\/170035.170072"},{"key":"49_CR2","unstructured":"Chen, L., Bhowmick, S., Li, J.: Temporal indirect association mining. In: http:\/\/www.cais.ntu.edu.sg\/sourav\/papers\/TIAPAKDD-05.pdf"},{"key":"49_CR3","unstructured":"Chen, X., Petrounias, I., Heathfield, H.: Discovery of association rules in temporal databases. In: Proc. of IADT (1998)"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Lee, C., Chen, M., Lin, C.: Progressive partition miner: an efficient algorithm for mining general temporal association rules. In: IEEE TKDE, vol.\u00a015(4) (2003)","DOI":"10.1109\/TKDE.2003.1209015"},{"key":"49_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45640-6_7","volume-title":"WEBKDD 2001 - Mining Web Log Data Across All Customers Touch Points","author":"P. Tan","year":"2001","unstructured":"Tan, P., Kumar, V.: Mining indirect associations in web data. In: Kohavi, R., Masand, B., Spiliopoulou, M., Srivastava, J. (eds.) WebKDD 2001. LNCS (LNAI), vol.\u00a02356, p. 145. Springer, Heidelberg (2001)"},{"key":"49_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-45372-5_77","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"P. Tan","year":"2000","unstructured":"Tan, P., Kumar, V., Srivastava, J.: Indirect association: mining higher order dependencies in data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 632\u2013637. Springer, Heidelberg (2000)"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Wan, Q., An, A.: Efficient mining of indirect associations using hi-mine. In: Proc. of Canadian Conference on AI (2003)","DOI":"10.1007\/3-540-44886-1_17"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11731139_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:49Z","timestamp":1619506309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11731139_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332060","9783540332077"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11731139_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}