Reducing and mining of frequent patterns in distributed databases
From MaRDI portal
Recommendations
Cited in
(7)- A fast and distributed algorithm for mining frequent patterns in congested networks
- dRAP-Independent: a data distribution algorithm for mining first-order frequent patterns
- Finding robust itemsets under subsampling
- scientific article; zbMATH DE number 2204015 (Why is no real title available?)
- Clustering local frequency items in multiple databases
- Fast Algorithm for Mining Global Frequent Itemsets Based on Distributed Database
- New and efficient algorithms for producing frequent itemsets with the Map-Reduce framework
This page was built for publication: Reducing and mining of frequent patterns in distributed databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3017070)