65 research outputs found
Deriving item features relevance from collaborative domain knowledge
An Item based recommender system works by computing a similarity between
items, which can exploit past user interactions (collaborative filtering) or
item features (content based filtering). Collaborative algorithms have been
proven to achieve better recommendation quality then content based algorithms
in a variety of scenarios, being more effective in modeling user behaviour.
However, they can not be applied when items have no interactions at all, i.e.
cold start items. Content based algorithms, which are applicable to cold start
items, often require a lot of feature engineering in order to generate useful
recommendations. This issue is specifically relevant as the content descriptors
become large and heterogeneous. The focus of this paper is on how to use a
collaborative models domain-specific knowledge to build a wrapper feature
weighting method which embeds collaborative knowledge in a content based
algorithm. We present a comparative study for different state of the art
algorithms and present a more general model. This machine learning approach to
feature weighting shows promising results and high flexibility
A Collective Variational Autoencoder for Top- Recommendation with Side Information
Recommender systems have been studied extensively due to their practical use
in many real-world scenarios. Despite this, generating effective
recommendations with sparse user ratings remains a challenge. Side information
associated with items has been widely utilized to address rating sparsity.
Existing recommendation models that use side information are linear and, hence,
have restricted expressiveness. Deep learning has been used to capture
non-linearities by learning deep item representations from side information but
as side information is high-dimensional existing deep models tend to have large
input dimensionality, which dominates their overall size. This makes them
difficult to train, especially with small numbers of inputs.
Rather than learning item representations, which is problematic with
high-dimensional side information, in this paper, we propose to learn feature
representation through deep learning from side information. Learning feature
representations, on the other hand, ensures a sufficient number of inputs to
train a deep network. To achieve this, we propose to simultaneously recover
user ratings and side information, by using a Variational Autoencoder (VAE).
Specifically, user ratings and side information are encoded and decoded
collectively through the same inference network and generation network. This is
possible as both user ratings and side information are data associated with
items. To account for the heterogeneity of user rating and side information,
the final layer of the generation network follows different distributions
depending on the type of information. The proposed model is easy to implement
and efficient to optimize and is shown to outperform state-of-the-art top-
recommendation methods that use side information.Comment: 7 pages, 3 figures, DLRS workshop 201
Preference modeling and Accuracy in Recommender Systems
University of Minnesota Ph.D. dissertation.September 2017. Major: Computer Science. Advisor: George Karypis. 1 computer file (PDF); xi, 101 pages.Recommender systems are widely used to recommend the most appealing items to users. In this thesis, we focus on analyzing the accuracy of the state-of-the-art matrix completion-based recommendation methods and develop methods to model users' preferences to address different problems that arise in recommender systems. Collaborative filtering-based methods are widely used to generate item recommendations to the user. The low-rank matrix completion method is the state-of-the-art collaborative filtering method. We will show that the accuracy and the ranking performance of matrix completion-based methods are affected by the skewed distribution of ratings in the user-item rating matrix. Additionally, we will illustrate that the number of ratings an item has positively correlates with the prediction accuracy and the ranking performance of the matrix completion approach for the item. Furthermore, we show that the users or the items that are present in the tail, i.e., those having few ratings in real datasets, may not have sufficient ratings to estimate the low-rank models accurately by matrix completion approach. We use these insights to develop TruncatedMF, a matrix completion-based approach that outperforms the state-of-the-art matrix completion method for the users and the items in the tail. Since for new items we do not have any prior preferences from existing users, it is hard to recommend these items to the users. We can use non-collaborative methods that rely on similarities between the new item and the items preferred by a user in the past to model the user preference for the new item. However, these methods consider the item features independently and ignore the interactions among the features of the items while computing the similarities. Modeling the interactions among features can provide more information towards the relevance of an item in comparison to the scenario when the features are considered independently. We develop a new method called User-specific Feature-based factorized Bilinear Similarity Model (UFBSM), that uses all available information across users to capture these interactions among features and learns a low-rank user personalized bilinear similarity model for the Top-n recommendation of new items. In addition to providing ratings over individual items, the users can also provide ratings on sets of items. A rating provided by a user on a set of items conveys some preference information about the items in the set and enables us to acquire a user’s preferences for more items that the number of ratings that the user provided. Moreover, users may have privacy concerns and hence may not be willing to indicate their preferences on individual items explicitly but may be willing to provide a rating to a set of items, as it provides some level of information hiding. We will investigate how do users’ item-level preferences relate to their set-level preferences. Also, we will introduce collaborative filtering-based methods that explicitly model the user behavior of providing ratings on sets of items and can be used to recommend items to users
BanditMF: Multi-Armed Bandit Based Matrix Factorization Recommender System
Multi-armed bandits (MAB) provide a principled online learning approach to
attain the balance between exploration and exploitation.Due to the superior
performance and low feedback learning without the learning to act in multiple
situations, Multi-armed Bandits drawing widespread attention in applications
ranging such as recommender systems. Likewise, within the recommender system,
collaborative filtering (CF) is arguably the earliest and most influential
method in the recommender system. Crucially, new users and an ever-changing
pool of recommended items are the challenges that recommender systems need to
address. For collaborative filtering, the classical method is training the
model offline, then perform the online testing, but this approach can no longer
handle the dynamic changes in user preferences which is the so-called
\textit{cold start}. So how to effectively recommend items to users in the
absence of effective information? To address the aforementioned problems, a
multi-armed bandit based collaborative filtering recommender system has been
proposed, named BanditMF. BanditMF is designed to address two challenges in the
multi-armed bandits algorithm and collaborative filtering: (1) how to solve the
cold start problem for collaborative filtering under the condition of scarcity
of valid information, (2) how to solve the sub-optimal problem of bandit
algorithms in strong social relations domains caused by independently
estimating unknown parameters associated with each user and ignoring
correlations between users.Comment: MSc dissertatio
Deep Item-based Collaborative Filtering for Top-N Recommendation
Item-based Collaborative Filtering(short for ICF) has been widely adopted in
recommender systems in industry, owing to its strength in user interest
modeling and ease in online personalization. By constructing a user's profile
with the items that the user has consumed, ICF recommends items that are
similar to the user's profile. With the prevalence of machine learning in
recent years, significant processes have been made for ICF by learning item
similarity (or representation) from data. Nevertheless, we argue that most
existing works have only considered linear and shallow relationship between
items, which are insufficient to capture the complicated decision-making
process of users.
In this work, we propose a more expressive ICF solution by accounting for the
nonlinear and higher-order relationship among items. Going beyond modeling only
the second-order interaction (e.g. similarity) between two items, we
additionally consider the interaction among all interacted item pairs by using
nonlinear neural networks. Through this way, we can effectively model the
higher-order relationship among items, capturing more complicated effects in
user decision-making. For example, it can differentiate which historical
itemsets in a user's profile are more important in affecting the user to make a
purchase decision on an item. We treat this solution as a deep variant of ICF,
thus term it as DeepICF. To justify our proposal, we perform empirical studies
on two public datasets from MovieLens and Pinterest. Extensive experiments
verify the highly positive effect of higher-order item interaction modeling
with nonlinear neural networks. Moreover, we demonstrate that by more
fine-grained second-order interaction modeling with attention network, the
performance of our DeepICF method can be further improved.Comment: 25 pages, submitted to TOI
- …