N-Most Interesting Closed Itemset Mining
Panida Songram, Veera Boonjing · 2008
In this paper, we propose an efficient algorithm, NCLOSED, for mining the N k-closed itemsets with the highest supports for 1 up to a certain kmaxvalue. The algorithm adopts best-first search strategy to generate closed itemsets with highest remaining supports. It does not keep closed itemsets mined in main memory to ensure that they are really closed. This is because this algorithm can directly generate closed itemsets. Moreover, duplicated closed itemsets are detected and discarded from this algorithm.