Particle Swarm Optimization-Based Association Rule Mining in Big Data Environment

32Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the explosive growth of information data in today's society, the continuous accumulation and increase of data in recent years make it difficult to extract useful information from it, so data mining comes into being. Association rule mining is an important part of data mining technology. Association rule mining is the discovery of frequent item sets in a large amount of data and the mining of strong association relations between them. Traditional association rule algorithms need to set minimum support and minimum confidence in advance. However, these two values are largely influenced by human subjectivity. Many scholars use average and weight to set these two values, but the effect is still not very good. In order to solve this problem, this paper proposed an improved algorithm of association rules-PSOFP growth algorithm, this algorithm is introduced into intelligent algorithm, particle swarm optimization algorithm, it can find the global optimal solution, we use this fact to find the optimal support, then using FP-growth algorithm for mining association rules, and finally put forward by information entropy to measure effectiveness in association rules mining, and the improved algorithm was applied to the social security event correlation analysis, the improved algorithm proved to our expectations.

Cite

CITATION STYLE

APA

Su, T., Xu, H., & Zhou, X. (2019). Particle Swarm Optimization-Based Association Rule Mining in Big Data Environment. IEEE Access, 7, 161008–161016. https://doi.org/10.1109/ACCESS.2019.2951195

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free