Next Article in Journal
Self-Weighted Quantile Estimation for Drift Coefficients of Ornstein–Uhlenbeck Processes with Jumps and Its Application to Statistical Arbitrage
Previous Article in Journal
Reinforcement Learning for Mitigating Malware Propagation in Wireless Radar Sensor Networks with Channel Modeling
Previous Article in Special Issue
BERT Mutation: Deep Transformer Model for Masked Uniform Mutation in Genetic Programming
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Elite Evolutionary Discrete Particle Swarm Optimization for Recommendation Systems

1
Graduate School of Technology, Industrial and Social Sciences, Tokushima University, Tokushima 770-8506, Japan
2
Faculty of Science and Technology, Hirosaki University, Hirosaki-shi 036-8560, Japan
*
Authors to whom correspondence should be addressed.
Mathematics 2025, 13(9), 1398; https://doi.org/10.3390/math13091398
Submission received: 24 March 2025 / Revised: 17 April 2025 / Accepted: 22 April 2025 / Published: 24 April 2025
(This article belongs to the Special Issue Machine Learning and Evolutionary Algorithms: Theory and Applications)

Abstract

Recommendation systems (RSs) play a vital role in e-commerce and content platforms, yet balancing efficiency and recommendation quality remains challenging. Traditional deep models are computationally expensive, while heuristic methods like particle swarm optimization struggle with discrete optimization. To address these limitations, this paper proposes elite-evolution-based discrete particle swarm optimization (EEDPSO), a novel framework specifically designed to optimize high-dimensional combinatorial recommendation tasks. EEDPSO restructures the velocity and position update mechanisms to operate effectively in discrete spaces, integrating neighborhood search, elite evolution strategies, and roulette-wheel selection to balance exploration and exploitation. Experiments on the MovieLens and Amazon datasets show that EEDPSO outperforms five metaheuristic algorithms (GA, DE, SA, SCA, and PSO) in both recommendation quality and computational efficiency. For datasets below the million-level scale, EEDPSO also demonstrates superior performance compared to deep learning models like FairGo. The results establish EEDPSO as a robust optimization strategy for recommendation systems that effectively handles the cold-start problem.
Keywords: recommendation system; metaheuristic algorithm; particle swarm optimization algorithm; elite evolution strategy; neighborhood search recommendation system; metaheuristic algorithm; particle swarm optimization algorithm; elite evolution strategy; neighborhood search

Share and Cite

MDPI and ACS Style

Lin, S.; Yang, Y.; Nagata, Y.; Yang, H. Elite Evolutionary Discrete Particle Swarm Optimization for Recommendation Systems. Mathematics 2025, 13, 1398. https://doi.org/10.3390/math13091398

AMA Style

Lin S, Yang Y, Nagata Y, Yang H. Elite Evolutionary Discrete Particle Swarm Optimization for Recommendation Systems. Mathematics. 2025; 13(9):1398. https://doi.org/10.3390/math13091398

Chicago/Turabian Style

Lin, Shanxian, Yifei Yang, Yuichi Nagata, and Haichuan Yang. 2025. "Elite Evolutionary Discrete Particle Swarm Optimization for Recommendation Systems" Mathematics 13, no. 9: 1398. https://doi.org/10.3390/math13091398

APA Style

Lin, S., Yang, Y., Nagata, Y., & Yang, H. (2025). Elite Evolutionary Discrete Particle Swarm Optimization for Recommendation Systems. Mathematics, 13(9), 1398. https://doi.org/10.3390/math13091398

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop