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

• scientific article; zbMATH DE number 1930110
• scientific article; zbMATH DE number 1738675
• scientific article; zbMATH DE number 2088043
• Efficient graph-based algorithms for discovering and maintaining association rules in large databases
• A framework for incremental generation of closed itemsets

Cites work

• scientific article; zbMATH DE number 1700010 (Why is no real title available?)
• A tree projection algorithm for generation of frequent item sets

Cited in

(4)

• scientific article; zbMATH DE number 1738675 (Why is no real title available?)
• Maintaining evidential frequent itemsets in case of data deletion
• Pattern space maintenance for data updates and interactive mining
• scientific article; zbMATH DE number 1930110 (Why is no real title available?)

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)