scholarly journals Local Weighted Matrix Factorization for Top-n Recommendation with Implicit Feedback

2016 ◽  
Vol 1 (4) ◽  
pp. 252-264 ◽  
Author(s):  
Keqiang Wang ◽  
Hongwei Peng ◽  
Yuanyuan Jin ◽  
Chaofeng Sha ◽  
Xiaoling Wang
2020 ◽  
Vol 34 (04) ◽  
pp. 3470-3477
Author(s):  
Jiawei Chen ◽  
Can Wang ◽  
Sheng Zhou ◽  
Qihao Shi ◽  
Jingbang Chen ◽  
...  

Recommendation from implicit feedback is a highly challenging task due to the lack of the reliable observed negative data. A popular and effective approach for implicit recommendation is to treat unobserved data as negative but downweight their confidence. Naturally, how to assign confidence weights and how to handle the large number of the unobserved data are two key problems for implicit recommendation models. However, existing methods either pursuit fast learning by manually assigning simple confidence weights, which lacks flexibility and may create empirical bias in evaluating user's preference; or adaptively infer personalized confidence weights but suffer from low efficiency.To achieve both adaptive weights assignment and efficient model learning, we propose a fast adaptively weighted matrix factorization (FAWMF) based on variational auto-encoder. The personalized data confidence weights are adaptively assigned with a parameterized neural network (function) and the network can be inferred from the data. Further, to support fast and stable learning of FAWMF, a new specific batch-based learning algorithm fBGD has been developed, which trains on all feedback data but its complexity is linear to the number of observed data. Extensive experiments on real-world datasets demonstrate the superiority of the proposed FAWMF and its learning algorithm fBGD.


Author(s):  
Keqiang Wang ◽  
Xiaoyi Duan ◽  
Jiansong Ma ◽  
Chaofeng Sha ◽  
Xiaoling Wang ◽  
...  

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 25248-25260 ◽  
Author(s):  
Hongmei Li ◽  
Xingchun Diao ◽  
Jianjun Cao ◽  
Qibin Zheng

Author(s):  
Menglei Hu ◽  
Songcan Chen

Real data are often with multiple modalities or from multiple heterogeneous sources, thus forming so-called multi-view data, which receives more and more attentions in machine learning. Multi-view clustering (MVC) becomes its important paradigm. In real-world applications, some views often suffer from instances missing. Clustering on such multi-view datasets is called incomplete multi-view clustering (IMC) and quite challenging. To date, though many approaches have been developed, most of them are offline and have high computational and memory costs especially for large scale datasets. To address this problem, in this paper, we propose an One-Pass Incomplete Multi-view Clustering framework (OPIMC). With the help of regularized matrix factorization and weighted matrix factorization, OPIMC can relatively easily deal with such problem. Different from the existing and sole online IMC method, OPIMC can directly get clustering results and effectively determine the termination of iteration process by introducing two global statistics. Finally, extensive experiments conducted on four real datasets demonstrate the efficiency and effectiveness of the proposed OPIMC method.


2022 ◽  
Vol 2022 ◽  
pp. 1-12
Author(s):  
Huazhen Liu ◽  
Wei Wang ◽  
Yihan Zhang ◽  
Renqian Gu ◽  
Yaqi Hao

Explicit feedback and implicit feedback are two important types of heterogeneous data for constructing a recommendation system. The combination of the two can effectively improve the performance of the recommendation system. However, most of the current deep learning recommendation models fail to fully exploit the complementary advantages of two types of data combined and usually only use binary implicit feedback data. Thus, this paper proposes a neural matrix factorization recommendation algorithm (EINMF) based on explicit-implicit feedback. First, neural network is used to learn nonlinear feature of explicit-implicit feedback of user-item interaction. Second, combined with the traditional matrix factorization, explicit feedback is used to accurately reflect the explicit preference and the potential preferences of users to build a recommendation model; a new loss function is designed based on explicit-implicit feedback to obtain the best parameters through the neural network training to predict the preference of users for items; finally, according to prediction results, personalized recommendation list is pushed to the user. The feasibility, validity, and robustness are fully demonstrated in comparison with multiple baseline models on two real datasets.


2020 ◽  
Vol 9 (8) ◽  
pp. 464
Author(s):  
Thaair Ameen ◽  
Ling Chen ◽  
Zhenxing Xu ◽  
Dandan Lyu ◽  
Hongyu Shi

Travel location recommendation methods using community-contributed geotagged photos are based on past check-ins. Therefore, these methods cannot effectively work for new travel locations, i.e., they suffer from the travel location cold start problem. In this study, we propose a convolutional neural network and matrix factorization-based travel location recommendation method to address the problem. Specifically, a weighted matrix factorization method is used to obtain the latent factor representations of travel locations. The latent factor representation for a new travel location is estimated from its photos by using a convolutional neural network. Experimental results on a Flickr dataset demonstrate that the proposed method can provide better recommendations than existing methods.


2019 ◽  
Vol 15 (8) ◽  
pp. 4591-4601 ◽  
Author(s):  
Baolin Yi ◽  
Xiaoxuan Shen ◽  
Hai Liu ◽  
Zhaoli Zhang ◽  
Wei Zhang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document