4,633 research outputs found
Reciprocal Recommendation System for Online Dating
Online dating sites have become popular platforms for people to look for
potential romantic partners. Different from traditional user-item
recommendations where the goal is to match items (e.g., books, videos, etc)
with a user's interests, a recommendation system for online dating aims to
match people who are mutually interested in and likely to communicate with each
other. We introduce similarity measures that capture the unique features and
characteristics of the online dating network, for example, the interest
similarity between two users if they send messages to same users, and
attractiveness similarity if they receive messages from same users. A
reciprocal score that measures the compatibility between a user and each
potential dating candidate is computed and the recommendation list is generated
to include users with top scores. The performance of our proposed
recommendation system is evaluated on a real-world dataset from a major online
dating site in China. The results show that our recommendation algorithms
significantly outperform previously proposed approaches, and the collaborative
filtering-based algorithms achieve much better performance than content-based
algorithms in both precision and recall. Our results also reveal interesting
behavioral difference between male and female users when it comes to looking
for potential dates. In particular, males tend to be focused on their own
interest and oblivious towards their attractiveness to potential dates, while
females are more conscientious to their own attractiveness to the other side of
the line
Can deep learning help you find the perfect match?
Is he/she my type or not? The answer to this question depends on the personal
preferences of the one asking it. The individual process of obtaining a full
answer may generally be difficult and time consuming, but often an approximate
answer can be obtained simply by looking at a photo of the potential match.
Such approximate answers based on visual cues can be produced in a fraction of
a second, a phenomenon that has led to a series of recently successful dating
apps in which users rate others positively or negatively using primarily a
single photo. In this paper we explore using convolutional networks to create a
model of an individual's personal preferences based on rated photos. This
introduced task is difficult due to the large number of variations in profile
pictures and the noise in attractiveness labels. Toward this task we collect a
dataset comprised of pictures and binary labels for each. We compare
performance of convolutional models trained in three ways: first directly on
the collected dataset, second with features transferred from a network trained
to predict gender, and third with features transferred from a network trained
on ImageNet. Our findings show that ImageNet features transfer best, producing
a model that attains accuracy on the test set and is moderately
successful at predicting matches
Musical recommendations and personalization in a social network
This paper presents a set of algorithms used for music recommendations and
personalization in a general purpose social network www.ok.ru, the second
largest social network in the CIS visited by more then 40 millions users per
day. In addition to classical recommendation features like "recommend a
sequence" and "find similar items" the paper describes novel algorithms for
construction of context aware recommendations, personalization of the service,
handling of the cold-start problem, and more. All algorithms described in the
paper are working on-line and are able to detect and address changes in the
user's behavior and needs in the real time.
The core component of the algorithms is a taste graph containing information
about different entities (users, tracks, artists, etc.) and relations between
them (for example, user A likes song B with certainty X, track B created by
artist C, artist C is similar to artist D with certainty Y and so on). Using
the graph it is possible to select tracks a user would most probably like, to
arrange them in a way that they match each other well, to estimate which items
from a fixed list are most relevant for the user, and more.
In addition, the paper describes the approach used to estimate algorithms
efficiency and analyze the impact of different recommendation related features
on the users' behavior and overall activity at the service.Comment: This is a full version of a 4 pages article published at ACM RecSys
201
Eliciting New Wikipedia Users' Interests via Automatically Mined Questionnaires: For a Warm Welcome, Not a Cold Start
Every day, thousands of users sign up as new Wikipedia contributors. Once
joined, these users have to decide which articles to contribute to, which users
to seek out and learn from or collaborate with, etc. Any such task is a hard
and potentially frustrating one given the sheer size of Wikipedia. Supporting
newcomers in their first steps by recommending articles they would enjoy
editing or editors they would enjoy collaborating with is thus a promising
route toward converting them into long-term contributors. Standard recommender
systems, however, rely on users' histories of previous interactions with the
platform. As such, these systems cannot make high-quality recommendations to
newcomers without any previous interactions -- the so-called cold-start
problem. The present paper addresses the cold-start problem on Wikipedia by
developing a method for automatically building short questionnaires that, when
completed by a newly registered Wikipedia user, can be used for a variety of
purposes, including article recommendations that can help new editors get
started. Our questionnaires are constructed based on the text of Wikipedia
articles as well as the history of contributions by the already onboarded
Wikipedia editors. We assess the quality of our questionnaire-based
recommendations in an offline evaluation using historical data, as well as an
online evaluation with hundreds of real Wikipedia newcomers, concluding that
our method provides cohesive, human-readable questions that perform well
against several baselines. By addressing the cold-start problem, this work can
help with the sustainable growth and maintenance of Wikipedia's diverse editor
community.Comment: Accepted at the 13th International AAAI Conference on Web and Social
Media (ICWSM-2019
Transfer Meets Hybrid: A Synthetic Approach for Cross-Domain Collaborative Filtering with Text
Collaborative filtering (CF) is the key technique for recommender systems
(RSs). CF exploits user-item behavior interactions (e.g., clicks) only and
hence suffers from the data sparsity issue. One research thread is to integrate
auxiliary information such as product reviews and news titles, leading to
hybrid filtering methods. Another thread is to transfer knowledge from other
source domains such as improving the movie recommendation with the knowledge
from the book domain, leading to transfer learning methods. In real-world life,
no single service can satisfy a user's all information needs. Thus it motivates
us to exploit both auxiliary and source information for RSs in this paper. We
propose a novel neural model to smoothly enable Transfer Meeting Hybrid (TMH)
methods for cross-domain recommendation with unstructured text in an end-to-end
manner. TMH attentively extracts useful content from unstructured text via a
memory module and selectively transfers knowledge from a source domain via a
transfer network. On two real-world datasets, TMH shows better performance in
terms of three ranking metrics by comparing with various baselines. We conduct
thorough analyses to understand how the text content and transferred knowledge
help the proposed model.Comment: 11 pages, 7 figures, a full version for the WWW 2019 short pape
- …