5,960 research outputs found
Some like it hot - visual guidance for preference prediction
For people first impressions of someone are of determining importance. They
are hard to alter through further information. This begs the question if a
computer can reach the same judgement. Earlier research has already pointed out
that age, gender, and average attractiveness can be estimated with reasonable
precision. We improve the state-of-the-art, but also predict - based on
someone's known preferences - how much that particular person is attracted to a
novel face. Our computational pipeline comprises a face detector, convolutional
neural networks for the extraction of deep features, standard support vector
regression for gender, age and facial beauty, and - as the main novelties -
visual regularized collaborative filtering to infer inter-person preferences as
well as a novel regression technique for handling visual queries without rating
history. We validate the method using a very large dataset from a dating site
as well as images from celebrities. Our experiments yield convincing results,
i.e. we predict 76% of the ratings correctly solely based on an image, and
reveal some sociologically relevant conclusions. We also validate our
collaborative filtering solution on the standard MovieLens rating dataset,
augmented with movie posters, to predict an individual's movie rating. We
demonstrate our algorithms on howhot.io which went viral around the Internet
with more than 50 million pictures evaluated in the first month.Comment: accepted for publication at CVPR 201
SAIN: Self-Attentive Integration Network for Recommendation
With the growing importance of personalized recommendation, numerous
recommendation models have been proposed recently. Among them, Matrix
Factorization (MF) based models are the most widely used in the recommendation
field due to their high performance. However, MF based models suffer from cold
start problems where user-item interactions are sparse. To deal with this
problem, content based recommendation models which use the auxiliary attributes
of users and items have been proposed. Since these models use auxiliary
attributes, they are effective in cold start settings. However, most of the
proposed models are either unable to capture complex feature interactions or
not properly designed to combine user-item feedback information with content
information. In this paper, we propose Self-Attentive Integration Network
(SAIN) which is a model that effectively combines user-item feedback
information and auxiliary information for recommendation task. In SAIN, a
self-attention mechanism is used in the feature-level interaction layer to
effectively consider interactions between multiple features, while the
information integration layer adaptively combines content and feedback
information. The experimental results on two public datasets show that our
model outperforms the state-of-the-art models by 2.13%Comment: SIGIR 201
Exploring Deep Space: Learning Personalized Ranking in a Semantic Space
Recommender systems leverage both content and user interactions to generate
recommendations that fit users' preferences. The recent surge of interest in
deep learning presents new opportunities for exploiting these two sources of
information. To recommend items we propose to first learn a user-independent
high-dimensional semantic space in which items are positioned according to
their substitutability, and then learn a user-specific transformation function
to transform this space into a ranking according to the user's past
preferences. An advantage of the proposed architecture is that it can be used
to effectively recommend items using either content that describes the items or
user-item ratings. We show that this approach significantly outperforms
state-of-the-art recommender systems on the MovieLens 1M dataset.Comment: 6 pages, RecSys 2016 RSDL worksho
Representation Learning for cold-start recommendation
A standard approach to Collaborative Filtering (CF), i.e. prediction of user
ratings on items, relies on Matrix Factorization techniques. Representations
for both users and items are computed from the observed ratings and used for
prediction. Unfortunatly, these transductive approaches cannot handle the case
of new users arriving in the system, with no known rating, a problem known as
user cold-start. A common approach in this context is to ask these incoming
users for a few initialization ratings. This paper presents a model to tackle
this twofold problem of (i) finding good questions to ask, (ii) building
efficient representations from this small amount of information. The model can
also be used in a more standard (warm) context. Our approach is evaluated on
the classical CF problem and on the cold-start problem on four different
datasets showing its ability to improve baseline performance in both cases.Comment: Accepted as workshop contribution at ICLR 201
Preference Networks: Probabilistic Models for Recommendation Systems
Recommender systems are important to help users select relevant and
personalised information over massive amounts of data available. We propose an
unified framework called Preference Network (PN) that jointly models various
types of domain knowledge for the task of recommendation. The PN is a
probabilistic model that systematically combines both content-based filtering
and collaborative filtering into a single conditional Markov random field. Once
estimated, it serves as a probabilistic database that supports various useful
queries such as rating prediction and top- recommendation. To handle the
challenging problem of learning large networks of users and items, we employ a
simple but effective pseudo-likelihood with regularisation. Experiments on the
movie rating data demonstrate the merits of the PN.Comment: In Proc. of 6th Australasian Data Mining Conference (AusDM), Gold
Coast, Australia, pages 195--202, 200
Multiangle social network recommendation algorithms and similarity network evaluation
Multiangle social network recommendation algorithms (MSN) and a new assessmentmethod, called similarity network evaluation (SNE), are both proposed. From the viewpoint of six dimensions, the MSN are classified into six algorithms, including user-based algorithmfromresource point (UBR), user-based algorithmfromtag point (UBT), resource-based algorithm fromtag point (RBT), resource-based algorithm from user point (RBU), tag-based algorithm from resource point (TBR), and tag-based algorithm from user point (TBU). Compared with the traditional recall/precision (RP) method, the SNE is more simple, effective, and visualized. The simulation results show that TBR and UBR are the best algorithms, RBU and TBU are the worst ones, and UBT and RBT are in the medium levels
- …