A decremental algorithm for maintaining frequent itemsets in dynamic databases

Publication Type:
Journal Article
Citation:
Lecture Notes in Computer Science, 2005, 3589 pp. 305 - 314
Issue Date:
2005-10-24
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2005000808.pdf672.24 kB
Adobe PDF
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining algorithms assume that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new data. While there are many efficient mining techniques for data additions to databases, in this paper, we propose a decrementai algorithm for pattern discovery when data is being deleted from databases. We conduct extensive experiments for evaluating this approach, and illustrate that the proposed algorithm can well model and capture useful interactions within data when the data is decreasing. © Springer-Verlag Berlin Heidelberg 2005.
Please use this identifier to cite or link to this item: