Eclat Algorithm

References

(Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Association_rule_learning#Eclat_algorithm Retrieved:2015-1-14.
- Eclat (alt. ECLAT, stands for Equivalence Class Transformation) is a depth-first search algorithm using set intersection.

http://en.wikibooks.org/wiki/Data_Mining_Algorithms_In_R/Frequent_Pattern_Mining/The_Eclat_Algorithm#The_Eclat_Algorithm
- The Eclat algorithm is used to perform itemset mining. Itemset mining let us find frequent patterns in data like if a consumer buys milk, he also buys bread. This type of pattern is called association rules and is used in many application domains. The basic idea for the eclat algorithm is use tidset intersections to compute the support of a candidate itemset avoiding the generation of subsets that does not exist in the prefix tree.
  The Eclat algorithm is defined recursively. The initial call uses all the single items with their tidsets. In each recursive call, the function IntersectTidsets verifies each itemset-tidset pair [math]\displaystyle{ \left\langle {X,t(X)} \right\rangle }[/math] with all the others pairs [math]\displaystyle{ \left\langle {Y,t(Y)} \right\rangle }[/math] to generate new candidates [math]\displaystyle{ N_{XY} }[/math]. If the new candidate is frequent, it is added to the set [math]\displaystyle{ P_{X} }[/math]. Then, recursively, it finds all the frequent itemsets in the [math]\displaystyle{ X }[/math] branch. The algorithm searches in a DFS manner to find all the frequent sets. ...