1,145 research outputs found
Trust based collaborative filtering
k-nearest neighbour (kNN) collaborative filtering (CF), the widely successful
algorithm supporting recommender systems, attempts to relieve the problem
of information overload by generating predicted ratings for items users have not
expressed their opinions about; to do so, each predicted rating is computed based
on ratings given by like-minded individuals. Like-mindedness, or similarity-based
recommendation, is the cause of a variety of problems that plague recommender
systems. An alternative view of the problem, based on trust, offers the potential to
address many of the previous limiations in CF. In this work we present a varation of
kNN, the trusted k-nearest recommenders (or kNR) algorithm, which allows users
to learn who and how much to trust one another by evaluating the utility of the rating
information they receive. This method redefines the way CF is performed, and
while avoiding some of the pitfalls that similarity-based CF is prone to, outperforms
the basic similarity-based methods in terms of prediction accuracy
Learning Heterogeneous Similarity Measures for Hybrid-Recommendations in Meta-Mining
The notion of meta-mining has appeared recently and extends the traditional
meta-learning in two ways. First it does not learn meta-models that provide
support only for the learning algorithm selection task but ones that support
the whole data-mining process. In addition it abandons the so called black-box
approach to algorithm description followed in meta-learning. Now in addition to
the datasets, algorithms also have descriptors, workflows as well. For the
latter two these descriptions are semantic, describing properties of the
algorithms. With the availability of descriptors both for datasets and data
mining workflows the traditional modelling techniques followed in
meta-learning, typically based on classification and regression algorithms, are
no longer appropriate. Instead we are faced with a problem the nature of which
is much more similar to the problems that appear in recommendation systems. The
most important meta-mining requirements are that suggestions should use only
datasets and workflows descriptors and the cold-start problem, e.g. providing
workflow suggestions for new datasets.
In this paper we take a different view on the meta-mining modelling problem
and treat it as a recommender problem. In order to account for the meta-mining
specificities we derive a novel metric-based-learning recommender approach. Our
method learns two homogeneous metrics, one in the dataset and one in the
workflow space, and a heterogeneous one in the dataset-workflow space. All
learned metrics reflect similarities established from the dataset-workflow
preference matrix. We demonstrate our method on meta-mining over biological
(microarray datasets) problems. The application of our method is not limited to
the meta-mining problem, its formulations is general enough so that it can be
applied on problems with similar requirements
Recommended from our members
Solving the stability-accuracy-diversity dilemma of recommender systems
Recommender systems are of great significance in predicting the potential interesting items based on the target user’s historical selections. However, the recommendation list for a specific user has been found changing vastly when the system changes, due to the unstable quantification of item similarities, which is defined as the recommendation stability problem. To improve the similarity stability and recommendation stability is crucial for the user experience enhancement and the better understanding of user interests. While the stability as well as accuracy of recommendation could be guaranteed by recommending only popular items, studies have been addressing the necessity of diversity which requires the system to recommend unpopular items. By ranking the similarities in terms of stability and considering only the most stable ones, we present a top-n-stability method based on the Heat Conduction algorithm (denoted as TNS-HC henceforth) for solving the stability-accuracy-diversity dilemma. Experiments on four benchmark data sets indicate that the TNS-HC algorithm could significantly improve the recommendation stability and accuracy simultaneously and still retain the high-diversity nature of the Heat Conduction algorithm. Furthermore, we compare the performance of the TNS-HC algorithm with a number of benchmark recommendation algorithms. The result suggests that the TNS-HC algorithm is more efficient in solving the stability-accuracy-diversity triple dilemma of
recommender systems
An improved model for trust-aware recommender systems based on multi-faceted trust
As customers enjoy the convenience of online shopping today, they face the problem of selecting from hundreds of thousands of products. Recommender systems, which make recommendations by matching products to customers based on the features of the products and the purchasing history of customers, are increasingly being incorporated into e-commerce websites. Collaborative filtering is a major approach to design algorithms for these systems. Much research has been directed toward enhancing the performance of recommender systems by considering various psychological and behavioural factors affecting the behaviour of users, e.g. trust and emotion.
While e-commerce firms are keen to exploit information on social trust available on social networks to improve their services, conventional trust-aware collaborative filtering does not consider the multi-facets of social trust. In this research, we assume that a consumer tends to trust different people for recommendations on different types of product. For example, a user trusts a certain reviewer on popular items but may not place as much trust on the same reviewer on unpopular items. Furthermore, this thesis postulates that if we, as online shoppers, choose to establish trust on an individual while we ourselves are reviewing certain products, we value this individual’s opinions on these products and we most likely will value his/her opinions on similar products in future.
Based on the above assumptions, this thesis proposes a new collaborative filtering algorithm for deriving multi-faceted trust based on trust establishment time. Experimental results based on historical data from Epinions show that the new algorithm can perform better in terms of accuracy when compared with conventional algorithms
- …