{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:34Z","timestamp":1725565234839},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_56","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:48:20Z","timestamp":1284162500000},"page":"458-463","source":"Crossref","is-referenced-by-count":1,"title":["Data Mining Proxy: Serving Large Number of Users for Efficient Frequent Itemset Mining"],"prefix":"10.1007","author":[{"given":"Zhiheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongjun","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yabo","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guimei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R.C. Agarwal","year":"2001","unstructured":"Agarwal, R.C., Aggarwal, C.C., Prasad, V.V.V.: A tree projection algorithm for generation of frequent item sets. Journal of Parallel and Distributed Computing\u00a061, 350\u2013371 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: Efficiently mining long patterns from databases. In: Proceedigns of 1998 ACM SIGMOD Intl. Conference on Management of Data, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of 2001 Intl. Conference on Data Engineering (ICDE 2001), April 2001, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"56_CR4","volume-title":"ACM SIGKDD Explorations","author":"J. Han","year":"2001","unstructured":"Han, J., Pei, J.: Mining frequent patterns by pattern-growth: Methodology and implications. In: ACM SIGKDD Explorations, December 2001, ACM Press, New York (2001)"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD Conference, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"56_CR6","unstructured":"Liu, G., Lu, H., Lou, W., Xu, Y., Yu, J.X.: Efficient mining of frequent itemsets using ascending frequency ordered prefix-tree. In: Proceedings of DASFAA 2003, pp. 65\u201372 (2003)"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Liu, J., Pan, Y., Wang, K., Han, J.: Mining frequent item sets by opportunistic projection. In: Proceedings of the 8th KDD Conference (2002)","DOI":"10.1145\/775047.775081"},{"key":"56_CR8","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, D.Y.S.: H-mine: Hyper-structure mining of frequent patterns in large databases. In: Proceedings of 2001 IEEE Conference on Data Mining (2001)"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Wang, K., Tang, L., Han, J., Liu, J.: Top down FP-growth for association rule mining. In: Proceedings of 6th Pacific-Asia conference on Knowledge Discovery and Data Mining (2002)","DOI":"10.1007\/3-540-47887-6_34"},{"key":"56_CR10","unstructured":"Xu, Y., Yu, J.X., Liu, G., Lu, H.: From path tree to frequent patterns: A framework for mining frequent patterns. In: Proceedings of IEEE ICDM 2002, pp. 514\u2013521 (2002)"}],"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\/978-3-540-24775-3_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:09:52Z","timestamp":1620011392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}