A novel algorithm for frequent itemset mining in data warehouses

DOI10.1631/JZUS.2006.A0216MaRDI QIDQ2508121zbMATH OpenOpenAlexFDO

Authors Lijun Xu, Kanglin Xie

Publication date 9 October 2006

Published in Journal of Zhejiang University. Science A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1631/jzus.2006.a0216

zbMATH Keywords

Close itemsetDimension tableFact tableFrequent itemsetStar schema

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• An algorithm for discovering the frequent closed itemsets in a large database
• An improved algorithm based on sets operation for mining frequent itemsets
• A novel algorithm of mining multidimensional association rules
• A novel bitmap-based algorithm for frequent itemsets mining
• An efficient algorithm for mining frequent maximal and closed itemsets

Cited in

(3)

• Multi-relational pattern mining over data streams
• Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse
• A novel bitmap-based algorithm for frequent itemsets mining

Describes a project that uses

Uses Software

• CLOSET

This page was built for publication: A novel algorithm for frequent itemset mining in data warehouses

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