NECLATCLOSED: A vertical algorithm for mining frequent closed itemsets

Frequent closed itemsets provide a lossless and concise collection of all frequent itemsets to reduce the runtime and memory requirement of frequent itemsets mining tasks. This study presents an algorithm named NECLAT-CLOSED for fast mining of frequent closed itemsets. We introduce concepts and techniques based on the vertical database format and employ them in the mining process. The experimental results show that NECLATCLOSED outperforms the leading algorithms in terms of runtime and memory usage, especially runtime, in most cases.

Automated summary

The study introduces an algorithm named NECLAT-CLOSED for fast mining of frequent closed itemsets. Experimental results show that NECLATCLOSED outperforms leading algorithms in terms of runtime and memory usage, especially in runtime.