Elite Evolutionary Discrete Particle Swarm Optimization for Recommendation Systems

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.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-04-24
DOI
https://doi.org/10.3390/math13091398
Citations
4
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
9.92
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Elite Evolutionary Discrete Particle Swarm Optimization for Recommendation Systems

Yifei Yang, Haichuan Yang, Yuichi Nagata, Shanxian Lin
4 citations
Mathematics
Metaheuristic Optimization Algorithms Research
9.92
article

Elite Evolutionary Discrete Particle Swarm Optimization for Recommendation Systems

Yifei Yang, Haichuan Yang, Yuichi Nagata, Shanxian Lin
article en
4 citations

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.

MathematicsVol. 13(9)
Hirosaki University (JP), Tokushima University (JP)
Openalex Percentile: Top 2%
Metaheuristic Optimization Algorithms Research
9.92
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.