Frequent Pattern Mining
From MaRDI portal
Publication:5168684
DOI10.1007/978-3-319-07821-2zbMath1297.68010OpenAlexW3150565720MaRDI QIDQ5168684
No author found.
Publication date: 18 July 2014
Full work available at URL: https://doi.org/10.1007/978-3-319-07821-2
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Artificial intelligence (68Txx)
Related Items (16)
A guided FP-growth algorithm for mining multitude-targeted item-sets and class association rules in imbalanced data ⋮ Efficient top-\(k\) high utility itemset mining on massive data ⋮ Sequence graph transform (SGT): a feature embedding function for sequence data mining ⋮ Exact stochastic constraint optimisation with applications in network analysis ⋮ One approach to decoding monotone logical function ⋮ An efficient approach for mining weighted uncertain interesting patterns ⋮ Mining time-constrained sequential patterns with constraint programming ⋮ Large-scale network motif analysis using compression ⋮ A tutorial on statistically sound pattern discovery ⋮ White-box Induction From SVM Models: Explainable AI with Logic Programming ⋮ Skopus: mining top-\(k\) sequential patterns under leverage ⋮ Flexible constrained sampling with guarantees for pattern mining ⋮ MiningZinc: a declarative framework for constraint-based mining ⋮ Unnamed Item ⋮ Mining frequent items in a product of partial orders using parallel calculations ⋮ Quantitative Redundancy in Partial Implications
This page was built for publication: Frequent Pattern Mining