{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:22Z","timestamp":1725550522872},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297697"},{"type":"electronic","value":"9783540321002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11576235_68","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T15:32:46Z","timestamp":1129649566000},"page":"668-677","source":"Crossref","is-referenced-by-count":0,"title":["Mining Frequent Closed Itemsets Without Candidate Generation"],"prefix":"10.1007","author":[{"given":"Kai","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceeding of the 20th VLDB Conference, Santiago, Chile (1994)"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association ruels. In: 7th International Conference on Database Theory (Janaury 1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"Silberschatz, A., Tuzhilin, A.: What Make Patterns Interesting in Knowledge Discovery Systems. IEEE Transaction on Knowledge and Data Engineering (December 1996)","DOI":"10.1109\/69.553165"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceeding of ACM SIGMOD 2000 (May 2000)","DOI":"10.1145\/342009.335372"},{"key":"68_CR5","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithms for Mining Frequent Closed Itemsets. In: DMKD 2000 (May 2000)"},{"key":"68_CR6","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: Proceeding of ACM SIGKDD 2003 (August 2003)","DOI":"10.1145\/956750.956779"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.: CHARM: An Efficient Alogrithm for Closed Itemset Mining. In: SDM 2002 (April 2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"68_CR8","doi-asserted-by":"crossref","unstructured":"Li, L., Zhai, D., Jin, F.: GRG: An Efficient Method for Association Rules Mining on Frequent Closed Itemsets. In: Proceeding of the 2003 IEEE International Symposium on Intelligent Control (October 2003)","DOI":"10.1109\/ISIC.2003.1254748"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11576235_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:56Z","timestamp":1605643136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11576235_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297697","9783540321002"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11576235_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}