Deep mining method for high-dimensional big data based on association rule
by Shu Xu
International Journal of Internet Protocol Technology (IJIPT), Vol. 14, No. 3, 2021

Abstract: Existing high-dimensional deep data mining methods have the problems of low precision and high energy consumption. Therefore, a deep mining method of high-dimensional big data based on association rules is proposed. Ealat algorithm is used to change the format of high-dimensional large data set. On this basis, MapReduce computing model is introduced to divide parallel tasks into map and reduce phases to realise the construction of operation platform. Hadoop's distributed file system is used to store distributed data. The input and output of the algorithm are converted into the form required by the MapReduce computing model to realise the deep mining of high-dimensional big data. Experimental results show that this method has higher mining accuracy and lower energy consumption. The result of practical application is good.

Online publication date: Mon, 06-Sep-2021

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 Internet Protocol Technology (IJIPT):
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