Mining Frequent Itemsets Algorithm Based on Compression Matrix
Year: 2014
Type: article
Abstract: Association rule mining is one of the most important and well researched techniques of data mining. The key procedure of the association rule mining is to find frequent itemsets. In this paper, a new mining frequent itemsets algorithm based on matrix is introduced. Frequent itemsets are obtained by compressing the transaction matrix efficiently by a new strategy. The new algorithm optimizes the known mining frequent itemsets algorithms based on matrix given by some researchers in recent years, which greatly reduces the temporal complexity and spatial complexity. It is more feasible especially when the degrees of the frequent itemsets are high.
Source: Applied Mechanics and Materials
Authors: Zi Zhi Lin, Si Hui Shu
Institution: Jiangxi Science and Technology Normal University
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W1988886931
