{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:50Z","timestamp":1725465590231},"publisher-location":"New York","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"038723151X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-23152-8_51","type":"book-chapter","created":{"date-parts":[[2006,1,19]],"date-time":"2006-01-19T01:36:28Z","timestamp":1137634588000},"page":"397-406","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Mining Frequent Itemsets with Compact FP-Tree"],"prefix":"10.1007","author":[{"given":"Liang-Xi","family":"Qin","sequence":"first","affiliation":[]},{"given":"Ping","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Zhong-Zhi","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal R C, Aggarwal C C, and Prasad V V V. A Tree Projection Algorithm for Generation of Frequent Itemsets. Journal of Parallel and Distributed Computing, 2001.","DOI":"10.1006\/jpdc.2000.1693"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large database. In Proc of 1993 ACM SIGMOD Conf on Management of Data, 207\u2013216, Washington DC, May 1993.","DOI":"10.1145\/170035.170072"},{"key":"51_CR3","unstructured":"Agrawal R, Srikant R. Fast algorithms for mining association rules. In Proc of the 20th Int\u2019l Conf on Very Large DataBases (VLDB\u201994). 487\u2013499. Santiago, Chile, Sept. 1994."},{"issue":"2","key":"51_CR4","first-page":"255","volume":"26","author":"S. Brin","year":"1997","unstructured":"Brin S, Motwani R, Ullman J D, and Tsur S. Dynamic itemset counting and implication rules for market basket data. In SIGMOD Record (ACM Special Interest Group on Management of Data), 26(2):255, 1997","journal-title":"SIGMOD Record (ACM Special Interest Group on Management of Data)"},{"issue":"8","key":"51_CR5","first-page":"1216","volume":"40","author":"M. Fan","year":"2003","unstructured":"FAN Ming, LI Chuan. Mining frequent patterns in an FP-tree without conditional FP-tree generation (In Chinese). Journal of computer research and development, 40(8): 1216\u20131222. 2003.","journal-title":"Journal of computer research and development"},{"key":"51_CR6","unstructured":"Grahne G, Zhu J. Efficiently using prefix-trees in mining frequent itemsets. In: First Workshop on Frequent Itemset Mining Implementation (FIMI\u201903). Melbourne, FL"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, and Yin Y. Mining Frequent Patterns without Candidate Generation. In Proc of 2000 ACM-SIGMOD Int\u2019l Conf on Management of Data (SIGMOD\u201900). 1\u201312. Dallas, TX, 2000.","DOI":"10.1145\/342009.335372"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Park J S, Chen M-S and Yu P S. An Effective Hash-based Algorithm for Mining Association Rules. In: Proc of 1995 ACM-SIGMOD int\u2019l Conf on Management of Data (SIGMOD\u201995). San Jose, CA, 1995. 175\u2013186.","DOI":"10.1145\/223784.223813"},{"key":"51_CR9","unstructured":"Savasere A, Omiecinski E, Navathe S. An efficient Algorithm for Mining Association Rules in Large Databases, In Proc of 21st Int\u2019l Conf on Very Large Databases (VLDB\u201995), pages 432\u2013443. Zurich, Switzerland, Sept. 1995."},{"key":"51_CR10","unstructured":"Toivonen H. Sampling Large Databases for Association Rules. In Proc of 22nd Int\u2019l Conf on Very Large Databases (VLDB\u201996). pages 134\u2013145. Bombay, India, Sept. 1996."},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Zaki M, Parthasarathy S, Ogihara M, and Li W. New algorithms for fast discovery of association rules. In Heckerman D, Mannila H, Pregibon D, and Uthurusamy R eds, Proc of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), page 283. AAAI Press, 1997. http:\/\/citeseer.ist.psu.edu\/zaki97new.html","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"51_CR12","unstructured":"http:\/\/fuzzy.cs.uni-magdeburg.de\/~borgelt\/"},{"key":"51_CR13","unstructured":"http:\/\/www.cs.helsinki.fi\/u\/goethals\/"},{"key":"51_CR14","unstructured":"http:\/\/www.almaden.ibm.com\/softwarequest\/Resources\/datasets\/syndata.html"},{"key":"51_CR15","unstructured":"http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"}],"container-title":["IFIP International Federation for Information Processing","Intelligent Information Processing II"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-23152-8_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:56:09Z","timestamp":1605624969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-23152-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["038723151X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/0-387-23152-8_51","relation":{},"subject":[]}}