Introduction - If you have any usage issues, please Google them yourself
The pseudo code for the algorithm is given below for a transaction database {\displaystyle T} T, and a support threshold of {\displaystyle \epsilon } \epsilon . Usual set theoretic notation is employed, though note that {\displaystyle T} T is a multiset. {\displaystyle C_{k}} C_{k} is the candidate set for level {\displaystyle k} k. At each step, the algorithm is assumed to generate the candidate sets from the large item sets of the preceding level, heeding the downward closure lemma. {\displaystyle count[c]} count[c] accesses a field of the data structure that represents candidate set {\displaystyle c} c, which is initially assumed to be zero. Many details are omitted below, usually the most important part of the implementation is the data structure used for storing the candidate sets, and counting their frequencies.