Maintaining discovered frequent itemsets: Cases for changeable database and support

DOI10.1007/BF02947125MaRDI QIDQ1412151zbMATH OpenOpenAlexFDO

Authors A. Makinouchi, Xiaoping Du, Shi-Wei Tang

Publication date 10 March 2004

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02947125

zbMATH Keywords

data miningfirst maintaining process

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Towards efficient re-mining of frequent patterns upon threshold changes
• A low-scan incremental association rule maintenance method based on the apriori property
• Mining incremental association rules with generalized FP-tree
• Efficient graph-based algorithms for discovering and maintaining association rules in large databases
• A framework for incremental generation of closed itemsets

Cites work

• A tree projection algorithm for generation of frequent item sets
• Towards efficient data re-mining (DRM)

Cited in

(4)

• Maintaining evidential frequent itemsets in case of data deletion
• Pattern space maintenance for data updates and interactive mining
• A low-scan incremental association rule maintenance method based on the apriori property
• Towards efficient re-mining of frequent patterns upon threshold changes

Describes a project that uses

Uses Software

• CLOSET

This page was built for publication: Maintaining discovered frequent itemsets: Cases for changeable database and support

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1412151)