{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:25:43Z","timestamp":1648999543903},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[1997,6]]},"abstract":"<jats:p> Update of the single- and multi-level association rules discovered in large databases is inherently costly. The straight forward approach of re-running the discovery algorithm on the entire updated database to re-discover the association rules is not cost-effective. An incremental algorithm FUP have been proposed for the update of discovered single-level association rules. In this study, we have shown that the incremental technique in FUP can be generalized to other data mining systems. An efficient algorithm MLU<jats:sub>p<\/jats:sub> has been proposed for the updating of discovered multi-level association rules. Our performance study shows that MLU<jats:sub>p<\/jats:sub> has a superior performance over the representative mining algorithm such as ML-T2 in updating discovered multi-level association rules. <\/jats:p>","DOI":"10.1142\/s0218213097000153","type":"journal-article","created":{"date-parts":[[2003,10,22]],"date-time":"2003-10-22T09:26:17Z","timestamp":1066814777000},"page":"273-290","source":"Crossref","is-referenced-by-count":2,"title":["Incremental Updates of Discovered Multi-Level Association Rules"],"prefix":"10.1142","volume":"06","author":[{"given":"David W.","family":"Cheung","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong, P.R.China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent T.","family":"Ng","sequence":"additional","affiliation":[{"name":"Department of Computing, Hong Kong Polytechnic University, Hunghom, Hong Kong, P.R.China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin W.","family":"Tam","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong, P.R.China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213097000153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:45:46Z","timestamp":1565199946000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213097000153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1997,6]]}},"alternative-id":["10.1142\/S0218213097000153"],"URL":"https:\/\/doi.org\/10.1142\/s0218213097000153","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}