A Differential Evolution-Enhanced Position-Transitional Approach to Latent Factor Analysis
High-dimensional and sparse (HiDS) matrices are frequently adopted to describe the complex relationships in various big data-related systems and applications. A Position-transitional Latent Factor Analysis (PLFA) model can accurately and efficiently represent an HiDS matrix. However, its involved latent factors are optimized by particle-swarm-optimization-incorporated stochastic gradient descent with the specific gradient direction step-by-step, which may cause a suboptimal solution. To address this issue, this paper proposes a S equential- G roup- D ifferential- E volution (SGDE) algorithm to refine the latent factors optimized by a PLFA model, thereby achieving a highly-accurate SGDE-PLFA model to HiDS matrices. The main idea of SGDE-PLFA is two-fold. First, it divides the obtained latent factors by PLFA into row and column sub-groups to ensure the efficient low-dimensional optimization. Second, it initializes and optimizes these sub-group latent factors with our improved Differential Evolution algorithm to search more accurate solutions nearby the suboptimum. As demonstrated by the extensive experiments on four HiDS matrices, an SGDE-PLFA model outperforms the state-of-the-art models in representing HiDS matrices.
Code (1)
Tasks
PositionSimilar Papers 제목 키워드 기반
A Differential Evolution-Enhanced Latent Factor Analysis Model for High-dimensional and Sparse Data
High-dimensional and sparse (HiDS) matrices are frequently adopted to describe the complex relationships in various big data-related systems and applications. A Position-transitional Latent Factor Analysis (PLFA) model c…
PositionDeep Learning-Driven Prediction of Microstructure Evolution via Latent Space Interpolation
Phase-field models accurately simulate microstructure evolution, but their dependence on solving complex differential equations makes them computationally expensive. This work achieves a significant acceleration via a no…
Enhanced Opposition Differential Evolution Algorithm for Multimodal Optimization
Most of the real-world problems are multimodal in nature that consists of multiple optimum values. Multimodal optimization is defined as the process of finding multiple global and local optima (as opposed to a single sol…
Evolutionary AlgorithmsGraph-Enhanced Multi-Task Learning of Multi-Level Transition Dynamics for Session-based Recommendation
Session-based recommendation plays a central role in a wide spectrum of online applications, ranging from e-commerce to online advertising services. However, the majority of existing session-based recommendation techniqu…
Graph Neural NetworkMulti-Task LearningRelationSession-Based RecommendationsDistilling Transitional Pattern to Large Language Models for Multimodal Session-based Recommendation
Session-based recommendation (SBR) predicts the next item based on anonymous sessions. Traditional SBR explores user intents based on ID collaborations or auxiliary content. To further alleviate data sparsity and cold-st…
Mutual Information EstimationSession-Based Recommendations