A Social Recommendation Based on Metric Learning and Network Embedding

Author(s):  
Xiaotong Li ◽  
Yan Tang
Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2158
Author(s):  
Xin Zhang ◽  
Jiwei Qin ◽  
Jiong Zheng

For personalized recommender systems, matrix factorization and its variants have become mainstream in collaborative filtering. However, the dot product in matrix factorization does not satisfy the triangle inequality and therefore fails to capture fine-grained information. Metric learning-based models have been shown to be better at capturing fine-grained information than matrix factorization. Nevertheless, most of these models only focus on rating data and social information, which are not sufficient for dealing with the challenges of data sparsity. In this paper, we propose a metric learning-based social recommendation model called SRMC. SRMC exploits users’ co-occurrence patterns to discover their potentially similar or dissimilar users with symmetric relationships and change their relative positions to achieve better recommendations. Experiments on three public datasets show that our model is more effective than the compared models.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 209483-209494
Author(s):  
Chang Su ◽  
Zongchao Hu ◽  
Xianzhong Xie

Author(s):  
Huanguang Wu ◽  
Donghai Guan ◽  
Guangjie Han ◽  
Weiwei Yuan ◽  
Mohsen Guizani

Author(s):  
Yao Yang ◽  
Haoran Chen ◽  
Junming Shao

Deep autoencoder is widely used in dimensionality reduction because of the expressive power of the neural network. Therefore, it is naturally suitable for embedding tasks, which essentially compresses high-dimensional information into a low-dimensional latent space. In terms of network representation, methods based on autoencoder such as SDNE and DNGR have achieved comparable results with the state-of-arts. However, all of them do not leverage label information, which leads to the embeddings lack the characteristic of discrimination. In this paper, we present Triplet Enhanced AutoEncoder (TEA), a new deep network embedding approach from the perspective of metric learning. Equipped with the triplet-loss constraint, the proposed approach not only allows capturing the topological structure but also preserving the discriminative information. Moreover, unlike existing discriminative embedding techniques, TEA is independent of any specific classifier, we call it the model-free property. Extensive empirical results on three public datasets (i.e, Cora, Citeseer and BlogCatalog) show that TEA is stable and achieves state-of-the-art performance compared with both supervised and unsupervised network embedding approaches on various percentages of labeled data. The source code can be obtained from https://github.com/yybeta/TEA.


Author(s):  
Xin Zhang ◽  
Jiwei Qin ◽  
Jiong Zheng

For personalized recommender systems,matrix factorization and its variants have become mainstream in collaborative filtering.However,the dot product in matrix factorization does not satisfy the triangle inequality and therefore fails to capture fine-grained information. Metric learning-based models have been shown to be better at capturing fine-grained information than matrix factorization. Nevertheless,most of these models only focus on rating data and social information, which are not sufficient for dealing with the challenges of data sparsity. In this paper,we propose a metric learning-based social recommendation model called SRMC.SRMC exploits users' co-occurrence pattern to discover their potentially similar or dissimilar users with symmetric relationships and change their relative positions to achieve better recommendations.Experiments on three public datasets show that our model is more effective than the compared models.


2019 ◽  
Vol E102.D (3) ◽  
pp. 568-578
Author(s):  
Xiaotao CHENG ◽  
Lixin JI ◽  
Ruiyang HUANG ◽  
Ruifei CUI

Author(s):  
Xiaoxue Li ◽  
Yangxi Li ◽  
Yanmin Shang ◽  
Lingling Tong ◽  
Fang Fang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document