doi: 10.4304/jsw.9.9.2361-2365
An Algorithm for Mining Frequent Itemsets from Library Big Data
- Library, Nanyang Institute of Technology, Nanyang, Henan 473000, China
Abstract
Frequent itemset mining plays an important part in college library data analysis. Because there are a lot of redundant data in library database, the mining process may generate intra-property frequent itemsets, and this hinders its efficiency significantly. To address this issue, we propose an improved FP-Growth algorithm we call RFP-Growth to avoid generating intra-property frequent itemsets, and to further boost its efficiency, implement its MapReduce version with additional prune strategy. The proposed algorithm was tested using both synthetic and real world library data, and the experimental results showed that the proposed algorithm outperformed existing algorithms.
Keywords
- big
- data;
- frequent
- itemset;
- data
- mining;
How to Cite
Xingjian Li, "An Algorithm for Mining Frequent Itemsets from Library Big Data," Journal of Software, vol. 9, no. 9, pp. 2361-2365, 2014. https://doi.org/ 10.4304/jsw.9.9.2361-2365
Copyright & License
Copyright © 2014 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).