The cleaning method of duplicate big data based on association rule mining algorithm
by Ming Wu
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 16, No. 2, 2023

Abstract: In order to overcome the problems of low cleaning efficiency and serious memory consumption in traditional large data cleaning methods, this paper proposes a new cleaning method of repeated big data based on association rule mining algorithm. This method uses association rule mining algorithm to obtain the frequent itemsets of repeated big data after repeated cycle calculation. At the same time, the output mode of the algorithm is optimised in parallel, and the Hadoop interface is modified to change the reading mode of MapReduce. The first frequent itemset is used to clean the repeated big data. The experimental results show that the proposed method can effectively reduce the execution time and memory consumption, and the shortest cleaning time is only 1.28 min, indicating the feasibility of the proposed method.

Online publication date: Wed, 24-May-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com