{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:47Z","timestamp":1725575267361},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240594"},{"type":"electronic","value":"9783540305491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30549-1_42","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T19:26:55Z","timestamp":1295206015000},"page":"475-487","source":"Crossref","is-referenced-by-count":3,"title":["Mining Maximal Frequent ItemSets Using Combined FP-Tree"],"prefix":"10.1007","author":[{"given":"Yuejin","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhoujun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuexin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huowang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB Conference, Santiago, Chile (1994)"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD 2000), Dallas, TX (May 2000)","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"42_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/bioinformatics\/14.1.55","volume":"14","author":"L. Rigoutsos","year":"1998","unstructured":"Rigoutsos, L., Floratos, A.: Combinatorial pattern discovery in biological sequences: The Teiresias algorithm. Bioinformatics\u00a014(1), 55\u201367 (1998)","journal-title":"Bioinformatics"},{"key":"42_CR4","unstructured":"Liu, G., Lu, H., Yu, J.X., Wang, W., Xiao, X.: AFOPT: An Efficient Implementation of Pattern Growth Approach. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Melbourne, Florida, USA, November 19 (2003)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo, R.: Efficiently mining long patterns from databases. In: ACM SIGMOD Conference (1998)","DOI":"10.1145\/276304.276313"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Aggarwal, C., Prasad, V.: A tree projection algorithm for generation of frequent itemsets. Journal of Parallel and Distributed Computing (2001)","DOI":"10.1006\/jpdc.2000.1693"},{"key":"42_CR7","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A Performance Study of Mining Maximal Frequent Itemsets. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations Melbourne, Florida, USA, November 19 (2003)"},{"key":"42_CR8","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An efficient algorithm for closed association rule mining. TR 99-10, CS Dept., RPI (October 1999)"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets. In: Proc. of the IEEE Int. Conference on Data Mining, San Jose (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"42_CR10","unstructured":"Grahne, G., Zhu, J.: Efficiently Using Prefix-trees in Mining Frequent Item-sets. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Imple-mentations, Melbourne, Florida, USA, November 19 (2003)"},{"key":"42_CR11","unstructured":"Goethals, B., Zaki, M.J.: FIMI 2003: Workshop on Frequent Itemset Mining Imple-mentations. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Melbourne, Florida, USA, (November 19 2003)"},{"key":"42_CR12","unstructured":"Codes and datasets available at: \n                      \n                        http:\/\/fimi.cs.helsinki.fi\/"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-30464-7_28","volume-title":"Conceptual Modeling \u2013 ER 2004","author":"Y. Yan","year":"2004","unstructured":"Yan, Y., Li, Z.-J., Chen, H.-w.: Fast mining maximal frequent itemSets based on FP-tree. In: Atzeni, P., et al. (eds.) ER 2004. LNCS, vol.\u00a03288, pp. 348\u2013361. Springer, Heidelberg (2004)"},{"key":"42_CR14","unstructured":"ER (2004): \n                      \n                        http:\/\/www.cs.fudan.edu.cn\/er2004\/"}],"container-title":["Lecture Notes in Computer Science","AI 2004: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30549-1_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:12Z","timestamp":1620012552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30549-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240594","9783540305491"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30549-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}