641,393 research outputs found
Improving information filtering via network manipulation
Recommender system is a very promising way to address the problem of
overabundant information for online users. Though the information filtering for
the online commercial systems received much attention recently, almost all of
the previous works are dedicated to design new algorithms and consider the
user-item bipartite networks as given and constant information. However, many
problems for recommender systems such as the cold-start problem (i.e. low
recommendation accuracy for the small degree items) are actually due to the
limitation of the underlying user-item bipartite networks. In this letter, we
propose a strategy to enhance the performance of the already existing
recommendation algorithms by directly manipulating the user-item bipartite
networks, namely adding some virtual connections to the networks. Numerical
analyses on two benchmark data sets, MovieLens and Netflix, show that our
method can remarkably improve the recommendation performance. Specifically, it
not only improve the recommendations accuracy (especially for the small degree
items), but also help the recommender systems generate more diverse and novel
recommendations.Comment: 6 pages, 5 figure
Quantum Recommendation Systems
A recommendation system uses the past purchases or ratings of products by
a group of users, in order to provide personalized recommendations to
individual users. The information is modeled as an preference
matrix which is assumed to have a good rank- approximation, for a small
constant .
In this work, we present a quantum algorithm for recommendation systems that
has running time . All known classical
algorithms for recommendation systems that work through reconstructing an
approximation of the preference matrix run in time polynomial in the matrix
dimension. Our algorithm provides good recommendations by sampling efficiently
from an approximation of the preference matrix, without reconstructing the
entire matrix. For this, we design an efficient quantum procedure to project a
given vector onto the row space of a given matrix. This is the first algorithm
for recommendation systems that runs in time polylogarithmic in the dimensions
of the matrix and provides an example of a quantum machine learning algorithm
for a real world application.Comment: 22 page
Solving the Cold-Start Problem in Recommender Systems with Social Tags
In this paper, based on the user-tag-object tripartite graphs, we propose a
recommendation algorithm, which considers social tags as an important role for
information retrieval. Besides its low cost of computational time, the
experiment results of two real-world data sets, \emph{Del.icio.us} and
\emph{MovieLens}, show it can enhance the algorithmic accuracy and diversity.
Especially, it can obtain more personalized recommendation results when users
have diverse topics of tags. In addition, the numerical results on the
dependence of algorithmic accuracy indicates that the proposed algorithm is
particularly effective for small degree objects, which reminds us of the
well-known \emph{cold-start} problem in recommender systems. Further empirical
study shows that the proposed algorithm can significantly solve this problem in
social tagging systems with heterogeneous object degree distributions
Outfit Recommender System
The online apparel retail market size in the United States is worth about seventy-two billion US dollars. Recommendation systems on retail websites generate a lot of this revenue. Thus, improving recommendation systems can increase their revenue. Traditional recommendations for clothes consisted of lexical methods. However, visual-based recommendations have gained popularity over the past few years. This involves processing a multitude of images using different image processing techniques. In order to handle such a vast quantity of images, deep neural networks have been used extensively. With the help of fast Graphics Processing Units, these networks provide results which are extremely accurate, within a small amount of time. However, there are still ways in which recommendations for clothes can be improved. We propose an event-based clothing recommendation system which uses object detection. We train a model to identify nine events/scenarios that a user might attend: White Wedding, Indian Wedding, Conference, Funeral, Red Carpet, Pool Party, Birthday, Graduation and Workout. We train another model to detect clothes out of fifty-three categories of clothes worn at the event. Object detection gives a mAP of 84.01. Nearest neighbors of the clothes detected are recommended to the user
Defining Regional Boundaries
The purpose of this resource is to identify a reqion for study as a system, and to establish a list of characteristics and features useful for determining the boundaries of regional systems. Students discuss their current understanding of what Earth systems are and how they work, and consider how to identify the boundaries of a region for Earth system study. In small groups, they select a region for recommendation to the class, and they make a list of characteristics and features that can mark the boundaries of regional systems. After presentations by each group, the class chooses one region for study as an Earth system. Then they mark the boundaries of their chosen region on their Landsat image, topographic map, or other map. Educational levels: Middle school, High school
A Hybrid Recommendation System Based on Association Rules
Recommendation systems are widely used in e-commerce applications. Theengine of a current recommendation system recommends items to a particular user based on user preferences and previous high ratings. Various recommendation schemes such as collaborative filtering and content-based approaches are used to build a recommendation system. Most of current recommendation systems were developed to fit a certain domain such as books, articles, and movies. We propose a hybrid framework recommendation system to be applied on two dimensional spaces (User × Item) with a large number of users and a small number of items. Moreover, our proposed framework makes use of both favorite and non-favorite items of a particular user. The proposed framework is built upon the integration of association rules mining and the content-based approach. The results of experiments show that our proposed framework can provide accurate recommendations to users
Context-aware food recommendation system
Recommendation systems are commonly used in websites with large datasets, frequently used in e-commerce or multimedia streaming services. These systems effectively help users in the task of finding items of their interest, while also being helpful from the perspective of the service or product provider. However, successful applications to other domains are less common, and the number of personalized food recommendation systems is surprisingly small although this particular domain could benefit significantly from recommendation knowledge. This work proposes a contextaware food recommendation system for well-being care applications, using mobile devices, beacons, medical records and a recommender engine. Users passing near a food place receives food recommendation based on available offers order by appropriate foods for everyone’s health at the table in real time. We also use a new robust recipe recommendation method based on matrix factorization and feature engineering, both supported by contextual information and statistical aggregation of information from users and items. The results got from the application of this method to three heterogeneous datasets of recipe’s user ratings, showed that gains are achieved regarding recommendation performance independently of the dataset size, the items textual properties or even the rating values distribution.info:eu-repo/semantics/publishedVersio
- …