{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:53Z","timestamp":1738387853699,"version":"3.35.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1007\/bf02947125","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T23:50:41Z","timestamp":1221263441000},"page":"648-658","source":"Crossref","is-referenced-by-count":2,"title":["Maintaining discovered frequent itemsets: Cases for changeable database and support"],"prefix":"10.1007","volume":"18","author":[{"given":"XiaoPing","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ShiWei","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makinouchi","family":"Akifumi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02947125_CR1","unstructured":"Agrawal R, Srikant R. Fast algorithms for mining association rules. InVLDB'94, Santiago de Chile, Sept. 1994, pp.487\u2013499."},{"key":"BF02947125_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R. Mining sequential patterns. InICDE'95, Taipei, March 1995, pp.3\u201314.","DOI":"10.1109\/ICDE.1995.380415"},{"key":"BF02947125_CR3","unstructured":"Pei Jet al. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. InICDE'01, Heiderberg, Germany, April 2001, pp.215\u2013224."},{"key":"BF02947125_CR4","unstructured":"Pei, J, Han J, Mao R. CLOSET: An efficient algorithm for mining frequent closed itemsets. InProc. ACMSIGMOD Int. Workshop Data Mining and Knowledge Discovery, Texas, USA, May 2000, pp.11\u201320."},{"key":"BF02947125_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo R J. Efficiently mining long patterns from databases. InSIGMOD'98, pp.85\u201393.","DOI":"10.1145\/276305.276313"},{"key":"BF02947125_CR6","unstructured":"Liu B, Hsu W, Ma Y. Integrating classification and association rule mining. InKDD'98, New York, USA, August 1998, pp80\u201386."},{"key":"BF02947125_CR7","unstructured":"Wang K, Zhou S, Liew S C. Building hierarchical classifiers using class proximity. InVLDB'99, Edinburgh, Scotland, UK, Sept. 1999, pp.363\u2013374."},{"key":"BF02947125_CR8","unstructured":"Kamber M, Han J, Chiang J Y. Metarule-guided mining of multi-dimensional association rules using data cubes. InKDD'97, California, USA, August 1997, pp.207\u2013210."},{"key":"BF02947125_CR9","doi-asserted-by":"crossref","unstructured":"Han J, Dong G, Yin Y. Efficient mining of partial periodic patterns in time series database. InICDE'99, Sydney, Australia, March 1999, pp.106\u2013115.","DOI":"10.1109\/ICDE.1999.754913"},{"key":"BF02947125_CR10","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. InSIGMOD'98, New York, USA, June 1998, pp.94\u2013105.","DOI":"10.1145\/276305.276314"},{"key":"BF02947125_CR11","doi-asserted-by":"crossref","unstructured":"Grahne G, Lakshmanan L, Wang X. Efficient mining of constrained correlated sets. InICDE'00, California, USA, March 2000, pp.512\u2013521.","DOI":"10.1109\/ICDE.2000.839450"},{"key":"BF02947125_CR12","doi-asserted-by":"crossref","unstructured":"Park J S, Chen M S, Yu P S. An effective hash-based algorithm for mining association rules. InSIGMOD'95, California, USA, May 1995, pp.175\u2013186.","DOI":"10.1145\/568271.223813"},{"key":"BF02947125_CR13","unstructured":"Srikant R, Vu Q, Agrawal R. Mining association rules with item constraints. InKDD'97, California, USA, August 1997, pp.67\u201373."},{"key":"BF02947125_CR14","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. InSIGMOD'00, Texas, USA, May 2000, pp.1\u201312.","DOI":"10.1145\/335191.335372"},{"key":"BF02947125_CR15","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R C Agrawal","year":"2001","unstructured":"Agrawal R C, Aggrawal C C, Prasad V V V. A tree projection algorithm for generation of frequent item sets.Journal of Parallel and Distributed Computing, 2001, 61: 350\u2013371.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"BF02947125_CR16","doi-asserted-by":"crossref","unstructured":"Cheung D Wet al. Maintenance of discovered association rules in large databases: An incremental updating technique. InICED'96, Louisiana, USA, March 1996, pp.106\u2013114.","DOI":"10.1109\/ICDE.1996.492094"},{"key":"BF02947125_CR17","unstructured":"Cheung D W, Ng V, Tam B W. Maintenance of discovered knowledge: A case in multi-level association rules. InKDD'96, Oregon, USA, 1996, pp.307\u2013310."},{"key":"BF02947125_CR18","doi-asserted-by":"crossref","unstructured":"Cheung D Wet al. A general incremental technique for updating discovered association rules. InProc. Int. Conf. on Database Systems for Advanced Application, Melbourne, Australia, April, 1997, pp.185\u2013194.","DOI":"10.1142\/9789812819536_0020"},{"key":"BF02947125_CR19","unstructured":"Lee S D, Cheung D W. Maintenance of discovered association rules: When to update? InProc. ACM-SIGMOD Workshop on Data Mining and Knowledge Discovery, Tucson, Arizona. May, 1997."},{"issue":"3","key":"BF02947125_CR20","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1009703019684","volume":"2","author":"S D Lee","year":"1998","unstructured":"Lee S D, Cheung D W, Kao B. Is sampling useful in data mining? A case in the maintenance of discovered association rules.Data Mining and Knowledge Discovery, Kluwer Academic Publishers, September, 1998, 2(3): 233\u2013262.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"BF02947125_CR21","unstructured":"Du X P, Kaneko K, Makinouchi A. Fast algorithm to find frequent itemsets for mining of association rules. InProc. Int. Conf. Info. Society in the 21st Century: Emerging Technologies and New Challenges, Fukushima, Japan, Nov., 2000, pp.408\u2013414."},{"key":"BF02947125_CR22","unstructured":"Du X P, Kaneko K, Makinouchi A. Two fast algorithms for repeated mining of association rules based on resource reuse. InICEIS 1999, Setubal, Portugal, Mar., 1999, pp.65\u201373."},{"issue":"1","key":"BF02947125_CR23","first-page":"81","volume":"5","author":"X P Du","year":"2000","unstructured":"Du X P, Kaneko K, Makinouchi A. Efficient algorithms to repeatedly mine large itemsets with different minimum supports.Res. Rep. ISEE Kyushu University, March 2000, 5(1): 81\u201386.","journal-title":"Res. Rep. ISEE Kyushu University"},{"key":"BF02947125_CR24","doi-asserted-by":"crossref","unstructured":"Liu J, Yin J. Towards efficient data re-ming. InPAKDD'01, Hong Kong, Cina, April 2001, pp.406\u2013412.","DOI":"10.1007\/3-540-45357-1_43"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02947125.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02947125\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02947125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:48:36Z","timestamp":1738363716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02947125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["BF02947125"],"URL":"https:\/\/doi.org\/10.1007\/bf02947125","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}