Bit-Table Based Biclustering and Frequent Closed Itemset Mining in High-Dimensional Binary Data

Pseudocode 1

Pseudocode of the Apriori-like algorithm.

(1) 𝐋¹={1−itemsets}

(2) 𝑘=2

(3) while 𝐋^𝑘−1  ≠ {}

(4)   𝐂^𝑘=𝐽𝑜𝑖𝑛(𝐋^𝑘−1)

(5)   𝐋^𝑘=𝑃𝑟𝑢𝑛𝑒(𝐂^𝑘)

(6)   𝐋=𝐋∪𝐋^𝑘

(7)   𝑘=𝑘+1

(8) end

(9) 𝐁=ExtractClosed(𝐋)