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.

Highlights

  • In today’s world, the application of data mining [1] is more and more extensive

  • The main work of this paper includes the following, 1) The particle swarm optimization algorithm is applied to the search for optimal support

  • 2) An improved FP-growth algorithm, PSOFP-growth algorithm, is proposed, which uses the optimal support obtained by particle swarm optimization algorithm to measure the effectiveness of association rules by taking information entropy as interestingness and reduce the occurrence of invalid rules

Read more

Summary

INTRODUCTION

In today’s world, the application of data mining [1] is more and more extensive. Data mining refers to applying algorithms to a large number of data, analyzing the data and mining the hidden information. The minimum support and minimum confidence of traditional association rule mining algorithms are set by users themselves. The characteristics of particle swarm optimization algorithm is to search the optimal solution in the whole world, we use it to find the optimal support, for the association rules algorithm of scanning data set filter data to provide the best support. The main work of this paper includes the following, 1) The particle swarm optimization algorithm is applied to the search for optimal support. 2) An improved FP-growth algorithm, PSOFP-growth algorithm, is proposed, which uses the optimal support obtained by particle swarm optimization algorithm to measure the effectiveness of association rules by taking information entropy as interestingness and reduce the occurrence of invalid rules.

RELTED WORK
THE BASIC CONCEPT
BUILD FREQUENT PATTERN TREES
FIND FREQUENT ITEM SETS
EXTRACT ASSOCIATION RULE
NUMERICAL RESULTS
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.