Research Article
Bit-Table Based Biclustering and Frequent Closed Itemset Mining in High-Dimensional Binary Data
Algorithm 2
MATLAB code 3: the generation of closed frequent itemsets.
(1) for k=1 : length(items)−1 | (2) Citems{k}=; | (3) for i=1:size(items{k}, 1) | (4) part=0; | (5) for j=1:sizeitems{k−1}, 1) | (6) IS intersect(items{k}(i,:), items{k+1j,:)); | (7) if and((sum(ismember(items{k}(i,:), IS))==k), s{k}(i)==s{k+1}(j)) | (8) part=part+1; end | (9) end | (10) if part==0 | (11) Citems{k}=Citems{k}; items{k}(i,:); | (12) end | (13) end | (14) end | (15) Citems{k+1}=items{end}; |
|