A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$ words (https://dl.acm.org/doi/pdf/10.1145/1014052.1014091) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1994 == Reference == http://www.vldb.org/conf/1994/P487.PDF")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ words

(https://dl.acm.org/doi/pdf/10.1145/1014052.1014091)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1994

Reference

http://www.vldb.org/conf/1994/P487.PDF

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=A-Priori_algorithm_(Finding_Frequent_Itemsets_Finding_Frequent_Itemsets)&oldid=44887"