{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:11:43Z","timestamp":1758265903458},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T00:00:00Z","timestamp":1340150400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10115-012-0514-9","type":"journal-article","created":{"date-parts":[[2012,6,19]],"date-time":"2012-06-19T12:31:09Z","timestamp":1340109069000},"page":"475-490","source":"Crossref","is-referenced-by-count":17,"title":["Batch incremental processing for FP-tree construction using FP-Growth algorithm"],"prefix":"10.1007","volume":"33","author":[{"given":"Shashikumar G.","family":"Totad","sequence":"first","affiliation":[]},{"given":"R. B.","family":"Geeta","sequence":"additional","affiliation":[]},{"given":"P. V. G. D.","family":"Prasad Reddy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,20]]},"reference":[{"key":"514_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of ACM-SIGMOD, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"514_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of VLDB, pp 487\u201399"},{"key":"514_CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10115-009-0205-3","volume":"23","author":"LM Aouad","year":"2010","unstructured":"Aouad LM, Le-Khac NA, Kechadi TM (2010) Performance study of distributed Apriori-like frequent itemsets mining. Knowl Inf Syst 23: 55\u201372. doi: 10.1007\/s10115-009-0205-3","journal-title":"Knowl Inf Syst"},{"key":"514_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo RJ (1998) Efficient mining long patterns from databases (1998). In: Proceedings of ACM SIGMOD international conference on management of data, pp 85\u201393","DOI":"10.1145\/276305.276313"},{"key":"514_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi F, Lucchese C (2004) On closed constrained frequent pattern mining. In: Proceedings of ICDM, pp 35\u201342","DOI":"10.1109\/ICDM.2004.10093"},{"key":"514_CR6","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of ICDE, pp 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"514_CR7","doi-asserted-by":"crossref","unstructured":"Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: Proceedings of DASFAA, pp 185\u2013194","DOI":"10.1142\/9789812819536_0020"},{"key":"514_CR8","doi-asserted-by":"crossref","unstructured":"Cheung W, Za\u00efane, OR (2003) Incremental mining of frequent patterns without candidate gneration or support constraint. In: Proceedings of international database engineering and applications symposium, pp 111\u2013116","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"514_CR9","unstructured":"Vishnu Priya R, Vadivel A, Thakur RS (2010) Frequent pattern mining using modified CP-tree for knowledge discovery in Springer, Berlin, Heidelberg. LNCS 2010, 6440:254\u2013261. doi: 10.1007\/978-3-642-17316-5-24"},{"key":"514_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0092-4","volume":"16","author":"J Cheng","year":"2008","unstructured":"Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data streams. Knowl Inf Syst 16: 1\u20132. doi: 10.1007\/s10115-007-0092-4","journal-title":"Knowl Inf Syst"},{"key":"514_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10115-007-0115-1","volume":"16","author":"SM Chung","year":"2008","unstructured":"Chung SM, Luo C (2008) Efficient mining of maximal frequent itemsets from databases on a cluster of workstations. Knowl Inf Syst 16: 359\u2013391. doi: 10.1007\/s10115-007-0115-1","journal-title":"Knowl Inf Syst"},{"key":"514_CR12","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Pedrajas N, de Haro-Garc\u00ed A (2012) Scaling up data mining algorithms: review and taxonomy. Prog Artif Intell 1:71\u201387. doi: 10.1007\/s13748-011-0004-4 (published online: 13 Jan 2012) 13.","DOI":"10.1007\/s13748-011-0004-4"},{"key":"514_CR13","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of SIGMOD 2000, pp 1\u201312","DOI":"10.1145\/335191.335372"},{"issue":"1","key":"514_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min Knowl Discov 8(1): 53\u201387","journal-title":"Data Min Knowl Discov"},{"key":"514_CR15","unstructured":"Koh YS, Dobbie G (2011) SPO-tree: efficient single pass ordered incremental pattern mining. Springer, Berlin, Heidelberg, LNCS 2011, vol 6862, pp 265\u2013276. doi: 10.1007\/978-3-642-23544-3-20"},{"issue":"3","key":"514_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"CK-S Leung","year":"2006","unstructured":"Leung CK-S, Khan QI, Li Z, Hoque T (2006) CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowl Inf Syst 11(3): 287\u2013311. doi: 10.1007\/s10115-006-0032-8","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"514_CR17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00354-008-0072-6","volume":"28","author":"C-W Lin","year":"2010","unstructured":"Lin C-W, Hong T-P, Lu W-H (2010) Using the structure of prelarge trees to incrementally mine frequent itemset. New Gener Comput 28(1): 5\u201320. doi: 10.1007\/s00354-008-0072-6","journal-title":"New Gener Comput"},{"key":"514_CR18","doi-asserted-by":"crossref","unstructured":"Luna JM, Romero JR, Ventura S (2012) Design and behavior study of a grammar-guided genetic programming algorithm for mining association rules. Knowl Inf Syst. doi: 10.1007\/s10115-011-0419-z (published online: 05 June 2012)","DOI":"10.1007\/s10115-011-0419-z"},{"key":"514_CR19","doi-asserted-by":"crossref","unstructured":"Li J, Zou Z, Gao H (2012) Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB J. doi: 10.1007\/s00778-012-0268-8 (published online: 28 Feb 2012)","DOI":"10.1007\/s00778-012-0268-8"},{"issue":"3","key":"514_CR20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.is.2004.02.001","volume":"30","author":"C-H Lee","year":"2005","unstructured":"Lee C-H, Lin C-R, Chen MS (2005) Slid-ing window filtering: an efficient method for incremental mining on a time-variant database. ELSEVIER-Inf Syst 30(3): 227\u2013244","journal-title":"ELSEVIER-Inf Syst"},{"key":"514_CR21","doi-asserted-by":"crossref","unstructured":"Leung CK-S, Khan QI, Hoque T et\u00a0al (2005) CanTree: a tree structure for efficient incremental mining of frequent patterns. In Proceedings of IEEE international conference on data mining (ICDM\u201905)","DOI":"10.1109\/ICDM.2005.38"},{"issue":"3","key":"514_CR22","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"CK Leung","year":"2007","unstructured":"Leung CK, Khan QI, Li Z et\u00a0al (2007) CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowl Inf Syst 11(3): 287\u2013311","journal-title":"Knowl Inf Syst"},{"key":"514_CR23","doi-asserted-by":"crossref","unstructured":"Shelokar P, Quirin A, Cord\u00f3n O (2011) MOSubdue: a Pareto dominance-based multiobjective Subdue algorithm for frequent subgraph mining. Knowl Inf Syst. doi: 10.1007\/s10115-011-0452-y (published online: 17 Nov 2011)","DOI":"10.1007\/s10115-011-0452-y"},{"key":"514_CR24","doi-asserted-by":"crossref","unstructured":"Tanbeer SK, Ahmed CF, Jeong BS et\u00a0al (2008) Efficient single-pass frequent pattern mining using a prefix-tree. Elsevier Inc J Inf Sci, pp 259\u2013283. doi: 10.1016\/j.ins.2008.10.027","DOI":"10.1016\/j.ins.2008.10.027"},{"issue":"5","key":"514_CR25","first-page":"28","volume":"5","author":"SG Totad","year":"2010","unstructured":"Totad SG, Geeta RB, Prasad Reddy PVGD (2010) Batch processing for incremental FP-tree construction. Int J Comput Appl IJCA 5(5): 28\u201332","journal-title":"Int J Comput Appl IJCA"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0514-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0514-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0514-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:27Z","timestamp":1559110227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0514-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,20]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0514-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,20]]}}}