{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:06:12Z","timestamp":1725559572721},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540269236"},{"type":"electronic","value":"9783540318910"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11510888_64","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T13:37:46Z","timestamp":1279460266000},"page":"651-659","source":"Crossref","is-referenced-by-count":16,"title":["Temporal Approach to Association Rule Mining Using T-Tree and P-Tree"],"prefix":"10.1007","author":[{"given":"Keshri","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O. P.","family":"Vyas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranjana","family":"Vyas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithm for mining association rule. In: VLDB 1994 Chile, September 1994, pp. 487\u2013499 (1994)"},{"key":"64_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44794-6_5","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"F.P. Coenen","year":"2001","unstructured":"Coenen, F.P., Goulbourne, G., Leng, P.H.: Computing Association Rules Using Partial Totals. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol.\u00a02168, pp. 54\u201366. Springer, Heidelberg (2001)"},{"key":"64_CR3","doi-asserted-by":"crossref","unstructured":"Coenen, F., Leng, P., Ahmed, S.: Data Structure for Association Rule Mining: T-tree and P- Tree. IEEE transaction on Knowledge Discovery and Data Engineering\u00a016(6) (2004)","DOI":"10.1109\/TKDE.2004.8"},{"key":"64_CR4","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining Frequent Patterns in Data Streams at Multiple TimeGranularities. In: Kargupta, H., Joshi, A., Sivakumar, K., Yesha, Y. (eds.) Next Generation Data Mining, pp. 191\u2013210 (2003)"},{"key":"64_CR5","unstructured":"Ale, J.M., Rossi, G.H.: An approach to discovering temporal association rules. In: ACM SIGDD (March 2002)"},{"key":"64_CR6","unstructured":"Ozden, B., Ramaswamy, S., Silberschatz, A.: Cyclic Association Rule. In: Proc. of forteenth International conference on Data Engineering, pp. 412\u2013425 (1998)"},{"key":"64_CR7","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J., Yin, Y., Mao, R.: Mining Frequent Pattern without Candidate Generation. In: Proc. ACM-SIGMOD Int\u2019l. Conf. Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"64_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45244-3_12","volume-title":"Temporal, Spatial, and Spatio-Temporal Data Mining","author":"J.F. Roddick","year":"2001","unstructured":"Roddick, J.F., Hornsby, K., Spiliopoulou, M.: An Updated Bibliography of Temporal, Spatial, and Spatio-temporal Data Mining Research. In: Roddick, J., Hornsby, K.S. (eds.) TSDM 2000. LNCS (LNAI), vol.\u00a02007, pp. 147\u2013164. Springer, Heidelberg (2001)"},{"key":"64_CR9","first-page":"504","volume-title":"3rd International conference KSS","author":"C.P. Rainsford","year":"1999","unstructured":"Rainsford, C.P., Roddick, J.F.: Adding Temporal semantics to association rule. In: 3rd International conference KSS, pp. 504\u2013509. Springer, Heidelberg (1999)"},{"key":"64_CR10","unstructured":"Chen, X., Petrounian, I.: A Development Framework of Temporal data Mining. In: Knowledge Discovery and Data Mining, ch.\u00a05, p. 93 (2001)"},{"key":"64_CR11","first-page":"193","volume-title":"Data and Knowledge Engineering","author":"Y. Li","year":"2003","unstructured":"Li, Y., Ning, P., Wang, X.S., Jajodia, S.: Discovering calendar- based temporal association rules. In: Data and Knowledge Engineering, vol.\u00a044, pp. 193\u2013214. Elsevier publisher, Amsterdam (2003)"},{"key":"64_CR12","doi-asserted-by":"crossref","unstructured":"Coenen, F., Leng, P., Ahmed, S.: Data Structure for Association Rule Mining: T-tree and P- Tree. IEEE transaction on Knowledge Discovery and Data Engineering\u00a016(6) (2004)","DOI":"10.1109\/TKDE.2004.8"},{"key":"64_CR13","unstructured":"Rymon, R.: Search Through Systematic Set Enumeration. In: Proc. Third Int\u2019l. Conf. Principles of Knowledge and Reasoning, pp. 539\u2013550 (1992)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11510888_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:20:37Z","timestamp":1558282837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11510888_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540269236","9783540318910"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11510888_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}