Graph Embedding Based Hybrid Social Recommendation System
원문 초록
Item recommendation tasks are a widely studied topic. Recent developments in deep learning and spectral methods paved a path towards efficient graph embedding techniques. But little research has been done on applying these graph embedding to social graphs for recommendation tasks. This paper focuses at performance of various embedding methods applied on social graphs for the task of item recommendation. Additionally, a hybrid model is proposed wherein chosen embedding models are combined together to give a collective output. We put forward the hypothesis that such a hybrid model would perform better than individual embedding for recommendation task. With recommendation using individual embedding as a baseline, performance for hybrid model for the same task is evaluated and compared. Standard metrics are used for qualitative comparison. It is found that the proposed hybrid model outperforms the baseline.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding
Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
AdvSGM: Differentially Private Graph Learning via Adversarial Skip-gram Model
Multi-dataset and Transfer Learning Using Gene Expression Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.