Frequent itemsets mining algorithm based on index array
Wang Ai-jie · Jisuanji yingyong yanjiu · 2009
The paper presented a new approach of increasing item to suffix of itemset recursively according to the classical association rule mining algorithms.And used a new data structure—index array to store frequent 1-itemset and its correlative information.So the relations of itemsets and transactions were found quickly.Presented a frequent itemsets mining algorithm based on index array and could mine all frequent itemsets through scanning database only twice.The experimental results show that the proposed algorithm outperforms similar state-of-the-art algorithms.