{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:15:20Z","timestamp":1725574520300},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405504"},{"type":"electronic","value":"9783540450801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45080-1_108","type":"book-chapter","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T23:54:03Z","timestamp":1294358043000},"page":"796-800","source":"Crossref","is-referenced-by-count":0,"title":["A Virtual Join Algorithm for Fast Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Minho","family":"Kim","sequence":"first","affiliation":[]},{"given":"Gye Hyung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"R. S.","family":"Ramakrishna","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"108_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. the 20th Int\u2019l Conf. VLDB, pp. 487\u2013499 (1994)"},{"key":"108_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. ACM SIGMOD Conf. on Management of Data, pp.1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"108_CR3","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proc. ACM SIGMOD Workshop on Data Mining and Knowl. Discovery, pp.21\u201332 (2000)"},{"key":"108_CR4","series-title":"Lecture Notes in Computer Science","first-page":"283","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"M.J. Zaki","year":"1997","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 1997. LNCS, vol.\u00a01263, pp. 283\u2013286. Springer, Heidelberg (1997)"},{"key":"108_CR5","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An Efficient Algorithm for Closed Itemset Mining. Tech. Rep. 99.10, Computer Science, RPI (1999)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45080-1_108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T05:43:22Z","timestamp":1553319802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45080-1_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405504","9783540450801"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45080-1_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}