MATEC Web Conf.
Volume 189, 20182018 2nd International Conference on Material Engineering and Advanced Manufacturing Technology (MEAMT 2018)
|Number of page(s)||7|
|Section||Bio & Human Engineering|
|Published online||10 August 2018|
An improvement of FP-Growth association rule mining algorithm based on adjacency table
School of Software and Microelectronics Northwestern Polytechnical University, Xi’an 710072, P.R China
2 Chinese helicopter design institute, Tianjin, P.R China
* Corresponding author: email@example.com
FP-Growth algorithm is an association rule mining algorithm based on frequent pattern tree (FP-Tree), which doesn’t need to generate a large number of candidate sets. However, constructing FP-Tree requires two scansof the original transaction database and the recursive mining of FP-Tree to generate frequent itemsets. In addition, the algorithm can’t work effectively when the dataset is dense. To solve the problems of large memory usage and low time-effectiveness of data mining in this algorithm, this paper proposes an improved algorithm based on adjacency table using a hash table to store adjacency table, which considerably saves the finding time. The experimental results show that the improved algorithm has good performance especially for mining frequent itemsets in dense data sets.
© The Authors, published by EDP Sciences, 2018
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.