In online shopping, a person’s interest in a product is closely related to whether they will purchase it Analyzing people’s interest in various products on time, along with product recommendations, can increase purc...
详细信息
ISBN:
(数字)9798331516147
ISBN:
(纸本)9798331516154
In online shopping, a person’s interest in a product is closely related to whether they will purchase it Analyzing people’s interest in various products on time, along with product recommendations, can increase purchase rates. However, in many cases, We only know user implicit feedback, such as browsing or favoriting items, and cannot directly access user explicit feedback, such as product ratings. Moreover, users have limited exposure to products, resulting in a sparse user-item matrix. The traditional Alternating Least Squares (ALS) algorithm can partially address the is of of matrix sparsity but its accuracy in recommending products based on implicit feedback alone is insufficient. This paper proposes an improved ALS algorithm that converts implicit feedback into explicit ratings. We calculate the browsing frequency of a product based on user browsing counts. For a given product, we represent user preference by suimming the browsing frequencies of all products with browsing frequencies less than or equal to that of the product. Then, by multiplying the preference level by the product’s maximum rating, we derive a product rating, achieving a transformation from implicit feedback to explicit scores. Additionally, traditional collaborative filtering algorithms often use offline data, which may not align with user current preferences. To improve the algorithm’s accuracy, we also utilize Flink for real-time data processing, allowing us to capture the most recent feedback data. This study tests the approach using the UserBehavior dataset from the publicly available Tianchi dataset. Experimental results indicate improvements in both Root Mean Square Error (RMSE) and Mean Absolute Error (MAE).
Open Set Domain Adaptation (OSDA) copes with the distribution and label shifts between the source and target domains simultaneously, performing accurate classification for known classes while identifying unknown class...
详细信息
In this study, an accurate diagnostic classification algorithm based on a deep belief network and entropy value (C-DBN-E) incorporating signal decomposition, entropy theory and deep belief network (DBN) network is pro...
详细信息
This paper analyzes the stability problem of load frequency control (LFC) for power systems under uncertain transmission delays. First, an argumented LFC system model accounting for uncertainties in transmission delay...
详细信息
UNet and its variants have widespread applications in medical image segmentation. However, the substantial number of parameters and computational complexity of these models make them less suitable for use in clinical ...
详细信息
ISBN:
(数字)9798350368741
ISBN:
(纸本)9798350368758
UNet and its variants have widespread applications in medical image segmentation. However, the substantial number of parameters and computational complexity of these models make them less suitable for use in clinical settings with limited computational resources. To address this limitation, we propose a novel Lightweight Shift U-Net (LSU-Net). We integrate the Light Conv Block and the Tokenized Shift Block in a lightweight manner, combining them with a dynamic weight multi-loss design for efficient dynamic weight allocation. The Light Conv Block effectively captures features with a low parameter count by combining standard convolutions with depthwise separable convolutions. The Tokenized Shift Block optimizes feature representation by shifting and capturing deep features through a combination of the Spatial Shift Block and depthwise separable convolutions. Dynamic adjustment of the loss weights at each layer approaches the optimal solution and enhances training stability. We validated LSU-Net on the UWMGI and MSD Colon datasets, and experimental results demonstrate that LSU-Net outperforms most state-of-the-art segmentation architectures.
Due to edge heterogeneity and data imbalance in edge computing, asynchronous federated learning (FL) is proposed to address the significant latency caused by synchronous FL. Asynchronous FL demands frequent communicat...
详细信息
Memristor crossbar array (MCA) is a computing-in-memory (CIM) module for computational acceleration. However, conventional read-write (R-W) circuits for MCA rely heavily on external components and have shortcoming in ...
详细信息
Most proposed memristor-based circuits of associative memory consider various mechanisms in only one associative memory. Few works on circuit design of sequential associative memory have been reported. In this paper, ...
详细信息
The platooning of connected and automated vehicles (CAVs) has the great potential to significantly improve travel experience in terms of safety, comfortableness, and energy efficiency. However, constrained by sensing ...
详细信息
The accurate quantification of risk caused by uncertainty forms a crucial foundation for formulating the generation maintenance scheduling (GMS) of power systems. However, the probability distribution functions (PDFs)...
详细信息
暂无评论