Graphs are everywhere -- Psst! In Music Recommendation too
원문 초록
In recent years, graphs have gained prominence across various domains, especially in recommendation systems. Within the realm of music recommendation, graphs play a crucial role in enhancing genre-based recommendations by integrating Mel-Frequency Cepstral Coefficients (MFCC) with advanced graph embeddings. This study explores the efficacy of Graph Convolutional Networks (GCN), GraphSAGE, and Graph Transformer (GT) models in learning embeddings that effectively capture intricate relationships between music items and genres represented within graph structures. Through comprehensive empirical evaluations on diverse real-world music datasets, our findings consistently demonstrate that these graph-based approaches outperform traditional methods that rely solely on MFCC features or collaborative filtering techniques. Specifically, the graph-enhanced models achieve notably higher accuracy in predicting genre-specific preferences and offering relevant music suggestions to users. These results underscore the effectiveness of utilizing graph embeddings to enrich feature representations and exploit latent associations within music data, thereby illustrating their potential to advance the capabilities of personalized and context-aware music recommendation systems. Keywords: graphs, recommendation systems, neural networks, MFCC
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation
Discrete Scale-invariant Metric Learning for Efficient Collaborative Filtering
Uncertainty in Repeated Implicit Feedback as a Measure of Reliability
Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative Filtering
SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.