1,900 research outputs found
Learning and Transferring IDs Representation in E-commerce
Many machine intelligence techniques are developed in E-commerce and one of
the most essential components is the representation of IDs, including user ID,
item ID, product ID, store ID, brand ID, category ID etc. The classical
encoding based methods (like one-hot encoding) are inefficient in that it
suffers sparsity problems due to its high dimension, and it cannot reflect the
relationships among IDs, either homogeneous or heterogeneous ones. In this
paper, we propose an embedding based framework to learn and transfer the
representation of IDs. As the implicit feedbacks of users, a tremendous amount
of item ID sequences can be easily collected from the interactive sessions. By
jointly using these informative sequences and the structural connections among
IDs, all types of IDs can be embedded into one low-dimensional semantic space.
Subsequently, the learned representations are utilized and transferred in four
scenarios: (i) measuring the similarity between items, (ii) transferring from
seen items to unseen items, (iii) transferring across different domains, (iv)
transferring across different tasks. We deploy and evaluate the proposed
approach in Hema App and the results validate its effectiveness.Comment: KDD'18, 9 page
Leveraging Deep Learning Techniques on Collaborative Filtering Recommender Systems
With the exponentially increasing volume of online data, searching and
finding required information have become an extensive and time-consuming task.
Recommender Systems as a subclass of information retrieval and decision support
systems by providing personalized suggestions helping users access what they
need more efficiently. Among the different techniques for building a
recommender system, Collaborative Filtering (CF) is the most popular and
widespread approach. However, cold start and data sparsity are the fundamental
challenges ahead of implementing an effective CF-based recommender. Recent
successful developments in enhancing and implementing deep learning
architectures motivated many studies to propose deep learning-based solutions
for solving the recommenders' weak points. In this research, unlike the past
similar works about using deep learning architectures in recommender systems
that covered different techniques generally, we specifically provide a
comprehensive review of deep learning-based collaborative filtering recommender
systems. This in-depth filtering gives a clear overview of the level of
popularity, gaps, and ignored areas on leveraging deep learning techniques to
build CF-based systems as the most influential recommenders.Comment: 24 pages, 14 figure
Recommender Systems
The ongoing rapid expansion of the Internet greatly increases the necessity
of effective recommender systems for filtering the abundant information.
Extensive research for recommender systems is conducted by a broad range of
communities including social and computer scientists, physicists, and
interdisciplinary researchers. Despite substantial theoretical and practical
achievements, unification and comparison of different approaches are lacking,
which impedes further advances. In this article, we review recent developments
in recommender systems and discuss the major challenges. We compare and
evaluate available algorithms and examine their roles in the future
developments. In addition to algorithms, physical aspects are described to
illustrate macroscopic behavior of recommender systems. Potential impacts and
future directions are discussed. We emphasize that recommendation has a great
scientific depth and combines diverse research fields which makes it of
interests for physicists as well as interdisciplinary researchers.Comment: 97 pages, 20 figures (To appear in Physics Reports
A Neural Attention Model for Adaptive Learning of Social Friends' Preferences
Social-based recommendation systems exploit the selections of friends to
combat the data sparsity on user preferences, and improve the recommendation
accuracy of the collaborative filtering strategy. The main challenge is to
capture and weigh friends' preferences, as in practice they do necessarily
match. In this paper, we propose a Neural Attention mechanism for Social
collaborative filtering, namely NAS. We design a neural architecture, to
carefully compute the non-linearity in friends' preferences by taking into
account the social latent effects of friends on user behavior. In addition, we
introduce a social behavioral attention mechanism to adaptively weigh the
influence of friends on user preferences and consequently generate accurate
recommendations. Our experiments on publicly available datasets demonstrate the
effectiveness of the proposed NAS model over other state-of-the-art methods.
Furthermore, we study the effect of the proposed social behavioral attention
mechanism and show that it is a key factor to our model's performance
Missing Value Imputation With Unsupervised Backpropagation
Many data mining and data analysis techniques operate on dense matrices or
complete tables of data. Real-world data sets, however, often contain unknown
values. Even many classification algorithms that are designed to operate with
missing values still exhibit deteriorated accuracy. One approach to handling
missing values is to fill in (impute) the missing values. In this paper, we
present a technique for unsupervised learning called Unsupervised
Backpropagation (UBP), which trains a multi-layer perceptron to fit to the
manifold sampled by a set of observed point-vectors. We evaluate UBP with the
task of imputing missing values in datasets, and show that UBP is able to
predict missing values with significantly lower sum-squared error than other
collaborative filtering and imputation techniques. We also demonstrate with 24
datasets and 9 supervised learning algorithms that classification accuracy is
usually higher when randomly-withheld values are imputed using UBP, rather than
with other methods
The power of implicit social relation in rating prediction of social recommender systems of social recommender
The explosive growth of social networks in recent times has presented a powerful source of information to be utilized as an extra source for assisting in the social recommendation problems. The social recommendation methods that are based on probabilistic matrix factorization improved the recommendation accuracy and partly solved the cold-start and data sparsity problems. However, these methods only exploited the explicit social relations and almost completely ignored the implicit social relations. In this article, we firstly propose an algorithm to extract the implicit relation in the undirected graphs of social networks by exploiting the link prediction techniques. Furthermore, we propose a new probabilistic matrix factorization method to alleviate the data sparsity problem through incorporating explicit friendship and implicit friendship. We evaluate our proposed approach on two real datasets, Last.Fm and Douban. The experimental results show that our method performs much better than the state-of-the-art approaches, which indicates the importance of incorporating implicit social relations in the recommendation process to address the poor prediction accuracy
- …