Optimization design based on hierarchic genetic algorithm and particles swarm algorithm

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For a lot of data, it is time-consuming and unpractical to get the best combination by manual tests. The genetic algorithm can make up for this shortcoming through the optimization of parameters. In this paper, the advantages of traditional similarity algorithm is studied, the time model and the trust model for further filtering are introduced, and the parameters with the combination of hierarchical genetic algorithm and particle swarm algorithm are optimized. In the collaborative filtering algorithm, genetic algorithm is improved with hierarchical algorithm, and the user model and the algorithm process are optimized using the fitness function of selection, crossover, and variation, along with the optimization of recommendation result set. In the algorithm, the global optimal parameters can be calculated with the optimization of the obtained initial data, and the accuracy of the similarity calculation can also be improved. This study does the recommendation and comparison experiment in the MovieLens Dataset, and the results show that, on the basis of obtaining the nearest neighbor user group, the mixing use of the hierarchical genetic algorithm and the particle swarm algorithm can make more improvement in the recommendation quality than that of the traditional similarity algorithm.

Cite

CITATION STYLE

APA

DengWei, L. (2018). Optimization design based on hierarchic genetic algorithm and particles swarm algorithm. Journal of Algorithms and Computational Technology, 12(3), 217–222. https://doi.org/10.1177/1748301818770943

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