Finding Frequent Itemsets: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 34: | Line 34: | ||
[[File:Finding Frequent Itemsets - Space.png|1000px]] | [[File:Finding Frequent Itemsets - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[File:Finding Frequent Itemsets - Pareto Frontier.png|1000px]] | [[File:Finding Frequent Itemsets - Pareto Frontier.png|1000px]] | ||
Revision as of 14:38, 15 February 2023
Description
We assume there is a number $s$, called the support threshold. If $I$ is a set of items, the support for $I$ is the number of baskets for which $I$ is a subset. We say $I$ is frequent if its support is $s$ or more
Parameters
No parameters found.
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| A-Priori algorithm | 1994 | $O(n^{2})$ | $O(n^{2})$ | Exact | Deterministic | Time & Space |
| The Algorithm of Park; Chen; and Yu (PCY) | 1995 | $O(n^{2})$ | $O(n^{2})$ | Exact | Deterministic | Time |
| The Multistage Algorithm | 1999 | $O(n^{2})$ | $O(n^{2})$ | Exact | Deterministic | Time |
| The Multihash Algorithm | 1999 | $O(n^{2})$ | $O(n^{2})$ | Exact | Deterministic | Time |
Time Complexity Graph
Space Complexity Graph
Space-Time Tradeoff Improvements
