Development of New Structure for Frequent Pattern Mining

Abstract

In this paper, we develop a new novel data structure called SH-Struct (Soft-Hyperlinked Structure) which mines the complete frequent itemset using SH-Mine algorithm. This algorithm enables frequent pattern mining with different supports. SH-Struct is based on creating SH-Tree which extends the idea of H-Struct to improvise storage compression and allow very fast frequent pattern mining. The algorithm has been tested extensively with various datasets and the experimental analysis shows that it outperforms FP-growth (Frequent Pattern growth) algorithm in terms of space and time payoffs.</p