Frequent itemsets mining segmentation algorithm based on vertical format

DOI10.13413/J.CNKI.JDXBLXB.2016.03.27MaRDI QIDQ3180614zbMATH OpenFDO

Authors Hongmei Wang, Ming Hu, Shoufeng Zhao

Publication date 6 January 2017

zbMATH Keywords

frequent itemsetexpected supportsegmented storagevertical format

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Database theory (68P15)

Recommendations

• An improved algorithm based on sets operation for mining frequent itemsets
• A novel bitmap-based algorithm for frequent itemsets mining
• Algorithm of mining frequent patterns based on the vertical bitmap
• An efficient algorithm of mining frequent closed inter-transaction itemsets
• An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning

Cited in

(1)

• Efficiently using prime-encoding for mining frequent itemsets in sparse data

This page was built for publication: Frequent itemsets mining segmentation algorithm based on vertical format

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