English
Related papers

Related papers: Local Collaborative Autoencoders

200 papers

We propose a deep-learning based method for obtaining standardized data coordinates from scientific measurements.Data observations are modeled as samples from an unknown, non-linear deformation of an underlying Riemannian manifold, which is…

Supervised operator learning is an emerging machine learning paradigm with applications to modeling the evolution of spatio-temporal dynamical systems and approximating general black-box relationships between functional data. We propose a…

Matrix Factorization (MF) is a very popular method for recommendation systems. It assumes that the underneath rating matrix is low-rank. However, this assumption can be too restrictive to capture complex relationships and interactions among…

Social and Information Networks · Computer Science 2017-09-15 Huan Zhao , Quanming Yao , James T. Kwok , Dik Lun Lee

Most existing One-Class Collaborative Filtering (OC-CF) algorithms estimate a user's preference as a latent vector by encoding their historical interactions. However, users often show diverse interests, which significantly increases the…

Information Retrieval · Computer Science 2020-10-27 Zheda Mai , Ga Wu , Kai Luo , Scott Sanner

Inferring user preferences from the historical feedback of users is a valuable problem in recommender systems. Conventional approaches often rely on the assumption that user preferences in the feedback data are equivalent to the real user…

Information Retrieval · Computer Science 2025-05-07 Hangtong Xu , Yuanbo Xu , Chaozhuo Li , Fuzhen Zhuang

Recommendation models can effectively estimate underlying user interests and predict one's future behaviors by factorizing an observed user-item rating matrix into products of two sets of latent factors. However, the user-specific embedding…

Information Retrieval · Computer Science 2022-03-08 Qitian Wu , Hengrui Zhang , Xiaofeng Gao , Junchi Yan , Hongyuan Zha

A fundamental requirement for intelligent systems is the ability to learn continuously under changing environments. However, models trained in this regime often suffer from catastrophic forgetting. Leveraging pre-trained models has recently…

Artificial Intelligence · Computer Science 2026-03-12 Tung Tran , Danilo Vasconcellos Vargas , Khoat Than

Recommender systems are essential tools in the digital era, providing personalized content to users in areas like e-commerce, entertainment, and social media. Among the many approaches developed to create these systems, latent factor models…

Information Retrieval · Computer Science 2025-01-06 Hind I. Alshbanat , Hafida Benhidour , Said Kerrache

Collaborative filtering is one of the most common scenarios and popular research topics in recommender systems. Among existing methods, latent factor models, i.e., learning a specific embedding for each user/item by reconstructing the…

Information Retrieval · Computer Science 2022-04-27 Yunfan Wu , Qi Cao , Huawei Shen , Shuchang Tao , Xueqi Cheng

With the widespread adoption of information systems, recommender systems are widely used for better user experience. Collaborative filtering is a popular approach in implementing recommender systems. Yet, collaborative filtering methods are…

Information Retrieval · Computer Science 2019-08-20 Sapumal Ahangama , Danny Chiang-Choon Poo

Latent factor models have been used widely in collaborative filtering based recommender systems. In recent years, deep learning has been successful in solving a wide variety of machine learning problems. Motivated by the success of deep…

Machine Learning · Computer Science 2019-12-11 Aanchal Mongia , Neha Jhamb , Emilie Chouzenoux , Angshul Majumdar

Non-Local Attention (NLA) is a powerful technique for capturing long-range feature correlations in deep single image super-resolution (SR). However, NLA suffers from high computational complexity and memory consumption, as it requires…

Computer Vision and Pattern Recognition · Computer Science 2024-04-09 Yigang Zhao Chaowei Zheng , Jiannan Su , GuangyongChen , MinGan

Auto-encoder models that preserve similarities in the data are a popular tool in representation learning. In this paper we introduce several auto-encoder models that preserve local distances when mapping from the data space to the latent…

Machine Learning · Computer Science 2022-10-03 Nutan Chen , Patrick van der Smagt , Botond Cseke

Autoencoders exhibit impressive abilities to embed the data manifold into a low-dimensional latent space, making them a staple of representation learning methods. However, without explicit supervision, which is often unavailable, the…

Machine Learning · Computer Science 2023-01-12 Felix Leeb , Stefan Bauer , Michel Besserve , Bernhard Schölkopf

Collaborative filtering analyzes user preferences for items (e.g., books, movies, restaurants, academic papers) by exploiting the similarity patterns across users. In implicit feedback settings, all the items, including the ones that a user…

Machine Learning · Statistics 2016-02-05 Dawen Liang , Laurent Charlin , James McInerney , David M. Blei

Autoencoders are a common building block of Deep Learning architectures, where they are mainly used for representation learning. They have also been successfully used in Collaborative Filtering (CF) recommender systems to predict missing…

Information Retrieval · Computer Science 2020-01-14 Pegah Sagheb Haghighi , Olurotimi Seton , Olfa Nasraoui

We propose a new method for training iterative collective classifiers for labeling nodes in network data. The iterative classification algorithm (ICA) is a canonical method for incorporating relational information into classification. Yet,…

Machine Learning · Computer Science 2017-03-21 Shuangfei Fan , Bert Huang

Standard Collaborative Filtering (CF) algorithms make use of interactions between users and items in the form of implicit or explicit ratings alone for generating recommendations. Similarity among users or items is calculated purely based…

Information Retrieval · Computer Science 2014-02-26 Jobin Wilson , Santanu Chaudhury , Brejesh Lall , Prateek Kapadia

Given a graph $G$ and a seed node $v_s$, the objective of local graph clustering (LGC) is to identify a subgraph $C_s \in G$ (a.k.a. local cluster) surrounding $v_s$ in time roughly linear with the size of $C_s$. This approach yields…

Social and Information Networks · Computer Science 2025-03-27 Haoran Zheng , Renchi Yang , Jianliang Xu

In this paper we address the problem of modeling relational data, which appear in many applications such as social network analysis, recommender systems and bioinformatics. Previous studies either consider latent feature based models but…

Data Structures and Algorithms · Computer Science 2012-04-13 Sheng Gao , Ludovic Denoyer , Patrick Gallinari
‹ Prev 1 2 3 10 Next ›