The evolution model for big data storage structure of online learning behaviour based on parallel algorithm Online publication date: Fri, 22-Jan-2021
by Ying Zhou
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 13, No. 4, 2020
Abstract: In order to overcome the heavy task of big data storage structure evolution computation, this paper proposes a parallel algorithm based network learning behaviour big data storage structure evolution model. This method introduces parallel algorithm, divides the whole dataset into several non overlapping data subsets randomly, mines the local frequent itemsets in the network learning behaviour big data in parallel and hierarchically, and connects the local frequent itemsets. Frequent itemsets can get all candidate sets. The actual support degree of different candidate sets is calculated by scanning datasets, and the evolution model of big data storage structure of network learning behaviour is established. The experimental results show that the operation efficiency of the proposed evolutionary model is as high as 99%, the cost is significantly lower than the other three evolutionary models, and the storage space consumption is the lowest.
Online publication date: Fri, 22-Jan-2021
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:
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 firstname.lastname@example.org