Embedding in Recommender Systems: A Survey

• URL: http://arxiv.org/abs/2310.18608v3
• Date: Wed, 22 Oct 2025 12:54:22 GMT
• Title: Embedding in Recommender Systems: A Survey
• Authors: Maolin Wang, Xinjian Zhao, Wanyu Wang, Sheng Zhang, Jiansheng Li, Bowen Yu, Binhao Wang, Shucheng Zhou, Dawei Yin, Qing Li, Ruocheng Guo, Xiangyu Zhao,
• Abstract summary: This survey presents a comprehensive analysis of advances in recommender system embedding techniques.<n>In matrix-based scenarios, collaborative filtering generates embeddings that effectively model user-item preferences.<n>We introduce emerging approaches, including AutoML, hashing techniques, and quantization methods, to enhance performance.
• Score: 54.55152033023537
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recommender systems have become an essential component of many online platforms, providing personalized recommendations to users. A crucial aspect is embedding techniques that convert the high-dimensional discrete features, such as user and item IDs, into low-dimensional continuous vectors, which can enhance the recommendation performance. Embedding techniques have revolutionized the capture of complex entity relationships, generating significant research interest. This survey presents a comprehensive analysis of recent advances in recommender system embedding techniques. We examine centralized embedding approaches across matrix, sequential, and graph structures. In matrix-based scenarios, collaborative filtering generates embeddings that effectively model user-item preferences, particularly in sparse data environments. For sequential data, we explore various approaches including recurrent neural networks and self-supervised methods such as contrastive and generative learning. In graph-structured contexts, we analyze techniques like node2vec that leverage network relationships, along with applicable self-supervised methods. Our survey addresses critical scalability challenges in embedding methods and explores innovative directions in recommender systems. We introduce emerging approaches, including AutoML, hashing techniques, and quantization methods, to enhance performance while reducing computational complexity. Additionally, we examine the promising role of Large Language Models (LLMs) in embedding enhancement. Through detailed discussion of various architectures and methodologies, this survey aims to provide a thorough overview of state-of-the-art embedding techniques in recommender systems, while highlighting key challenges and future research directions.

Related papers

• A Survey on Generative Recommendation: Data, Model, and Tasks [55.36322811257545]
  generative recommendation reconceptualizes recommendation as a generation task rather than discriminative scoring.<n>This survey provides a comprehensive examination through a unified tripartite framework spanning data, model, and task dimensions.<n>We identify five key advantages: world knowledge integration, natural language understanding, reasoning capabilities, scaling laws, and creative generation.
  arXiv  Detail & Related papers  (2025-10-31T04:02:58Z)
• Hybrid Matrix Factorization Based Graph Contrastive Learning for Recommendation System [8.093253521316667]
  Methods that combine contrastive learning with graph neural networks have emerged to address the challenges of recommendation systems.<n>In this paper, we propose a novel method called HMFGCL (Hybrid Matrix Factorization Based Graph Contrastive Learning)<n>It integrates two distinct matrix factorization techniques-low-rank matrix factorization (MF) and singular value decomposition (SVD)-to complementarily acquire global collaborative information.
  arXiv  Detail & Related papers  (2025-09-05T13:57:07Z)
• A Comprehensive Review on Hashtag Recommendation: From Traditional to Deep Learning and Beyond [0.37865171120254354]
  Hashtags, as a fundamental categorization mechanism, play a pivotal role in enhancing content visibility and user engagement.<n>The development of accurate and robust hashtag recommendation systems remains a complex and evolving research challenge.<n>This review article conducts a systematic analysis of hashtag recommendation systems, examining recent advancements across several dimensions.
  arXiv  Detail & Related papers  (2025-03-24T13:40:36Z)
• Generative Large Recommendation Models: Emerging Trends in LLMs for Recommendation [85.52251362906418]
  This tutorial explores two primary approaches for integrating large language models (LLMs) It provides a comprehensive overview of generative large recommendation models, including their recent advancements, challenges, and potential research directions. Key topics include data quality, scaling laws, user behavior mining, and efficiency in training and inference.
  arXiv  Detail & Related papers  (2025-02-19T14:48:25Z)
• A Survey on Recommendation Unlearning: Fundamentals, Taxonomy, Evaluation, and Open Questions [16.00188808166725]
  recommender systems have become increasingly influential in shaping user behavior and decision-making. Widespread adoption of machine learning models in recommender systems has raised significant concerns regarding user privacy and security. Traditional machine unlearning methods are ill-suited for recommendation unlearning due to the unique challenges posed by collaborative interactions and model parameters.
  arXiv  Detail & Related papers  (2024-12-17T11:58:55Z)
• A low-rank non-convex norm method for multiview graph clustering [0.0]
  This study introduces a novel multi-view clustering known as the "Consensus Graph-Based Multi-View Clustering Method Using Low-Rank Non-Convex Norm" The proposed method is amenable to efficient optimization using existing algorithms.
  arXiv  Detail & Related papers  (2023-12-18T12:54:24Z)
• Interactive Graph Convolutional Filtering [79.34979767405979]
  Interactive Recommender Systems (IRS) have been increasingly used in various domains, including personalized article recommendation, social media, and online advertising. These problems are exacerbated by the cold start problem and data sparsity problem. Existing Multi-Armed Bandit methods, despite their carefully designed exploration strategies, often struggle to provide satisfactory results in the early stages. Our proposed method extends interactive collaborative filtering into the graph model to enhance the performance of collaborative filtering between users and items.
  arXiv  Detail & Related papers  (2023-09-04T09:02:31Z)
• Impression-Aware Recommender Systems [57.38537491535016]
  Novel data sources bring new opportunities to improve the quality of recommender systems. Researchers may use impressions to refine user preferences and overcome the current limitations in recommender systems research. We present a systematic literature review on recommender systems using impressions.
  arXiv  Detail & Related papers  (2023-08-15T16:16:02Z)
• Rank Flow Embedding for Unsupervised and Semi-Supervised Manifold Learning [9.171175292808144]
  We propose a novel manifold learning algorithm named Rank Flow Embedding (RFE) for unsupervised and semi-supervised scenarios. RFE computes context-sensitive embeddings, which are refined following a rank-based processing flow. The generated embeddings can be exploited for more effective unsupervised retrieval or semi-supervised classification.
  arXiv  Detail & Related papers  (2023-04-24T21:02:12Z)
• Guided Depth Map Super-resolution: A Survey [88.54731860957804]
  Guided depth map super-resolution (GDSR) aims to reconstruct a high-resolution (HR) depth map from a low-resolution (LR) observation with the help of a paired HR color image. A myriad of novel and effective approaches have been proposed recently, especially with powerful deep learning techniques. This survey is an effort to present a comprehensive survey of recent progress in GDSR.
  arXiv  Detail & Related papers  (2023-02-19T15:43:54Z)
• Deep networks for system identification: a Survey [56.34005280792013]
  System identification learns mathematical descriptions of dynamic systems from input-output data. Main aim of the identified model is to predict new data from previous observations. We discuss architectures commonly adopted in the literature, like feedforward, convolutional, and recurrent networks.
  arXiv  Detail & Related papers  (2023-01-30T12:38:31Z)
• A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directions [48.97008907275482]
  Clustering is a fundamental machine learning task which has been widely studied in the literature. Deep Clustering, i.e., jointly optimizing the representation learning and clustering, has been proposed and hence attracted growing attention in the community. We summarize the essential components of deep clustering and categorize existing methods by the ways they design interactions between deep representation learning and clustering.
  arXiv  Detail & Related papers  (2022-06-15T15:05:13Z)
• Recent Advances in Embedding Methods for Multi-Object Tracking: A Survey [71.10448142010422]
  Multi-object tracking (MOT) aims to associate target objects across video frames in order to obtain entire moving trajectories. Embedding methods play an essential role in object location estimation and temporal identity association in MOT. We first conduct a comprehensive overview with in-depth analysis for embedding methods in MOT from seven different perspectives.
  arXiv  Detail & Related papers  (2022-05-22T06:54:33Z)
• Recent Advances in Heterogeneous Relation Learning for Recommendation [5.390295867837705]
  We review the development of recommendation frameworks with the focus on heterogeneous relational learning. The objective of this task is to map heterogeneous relational data into latent representation space. We discuss the learning approaches in each category, such as matrix factorization, attention mechanism and graph neural networks.
  arXiv  Detail & Related papers  (2021-10-07T13:32:04Z)
• A Survey on Neural Recommendation: From Collaborative Filtering to Content and Context Enriched Recommendation [70.69134448863483]
  Research in recommendation has shifted to inventing new recommender models based on neural networks. In recent years, we have witnessed significant progress in developing neural recommender models.
  arXiv  Detail & Related papers  (2021-04-27T08:03:52Z)
• Cluster Based Deep Contextual Reinforcement Learning for top-k Recommendations [2.8207195763355704]
  We propose a novel method for generating top-k recommendations by creating an ensemble of clustering with reinforcement learning. We have incorporated DB Scan clustering to tackle vast item space, hence in-creasing the efficiency multi-fold. With partial updates and batch updates, the model learns user patterns continuously.
  arXiv  Detail & Related papers  (2020-11-29T20:24:39Z)
• A Deep Hybrid Model for Recommendation Systems [0.0]
  We propose a new deep neural network architecture which consists of not only ID embeddings but also auxiliary information such as features of job postings and candidates for job recommendation system. Experimental results on the dataset from a job-site show that the proposed method improves recommendation results over deep learning models utilizing ID embeddings.
  arXiv  Detail & Related papers  (2020-09-21T10:41:28Z)
• Recommendation system using a deep learning and graph analysis approach [1.2183405753834562]
  We propose a novel recommendation method based on Matrix Factorization and graph analysis methods. In addition, we leverage deep Autoencoders to initialize users and items latent factors, and deep embedding method gathers users' latent factors from the user trust graph.
  arXiv  Detail & Related papers  (2020-04-17T08:05:33Z)
• A Survey on Knowledge Graph-Based Recommender Systems [65.50486149662564]
  We conduct a systematical survey of knowledge graph-based recommender systems. We focus on how the papers utilize the knowledge graph for accurate and explainable recommendation. We introduce datasets used in these works.
  arXiv  Detail & Related papers  (2020-02-28T02:26:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.