Mining maximal frequent itemsets in uncertain data

DOI10.13245/J.HUST.150906MaRDI QIDQ2992770zbMATH OpenFDO

Authors Xianghong Tang, Quanwei Yang, Yang Zheng

Publication date 10 August 2016

Full work available at URL https://doi.org/10.13245/J.HUST.150906

zbMATH Keywords

data mininggenetic algorithmuncertain datafrequent itemsetsfrequent pattern treemaximal frequent itemsets

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Database theory (68P15)

Recommendations

• Uncertain Frequent Pattern Mining
• Interactive Mining of Probabilistic Frequent Patterns in Uncertain Databases
• Efficiently mining uncertain high-utility itemsets
• Mining interesting patterns from uncertain databases
• MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree

Cited in

(5)

• Mining interesting patterns from uncertain databases
• Uncertain Frequent Pattern Mining
• Optimization of disjunctive rules mining from uncertain database
• Computing rarity on uncertain data
• Interactive Mining of Probabilistic Frequent Patterns in Uncertain Databases

This page was built for publication: Mining maximal frequent itemsets in uncertain data

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