26,720 research outputs found

    User Semantic Model for Hybrid Recommender Systems

    Get PDF
    International audienceRecommender systems provide relevant items to users from a large number of choices. In this work, we are interested in personalized recommender systems where user model is based on an analysis of usage. Collaborative filtering and content-based filtering are the most widely used techniques in personalized recommender systems. Each technique has its drawbacks, so hybrid solutions, combining the two techniques, have emerged to overcome their disadvantages and benefit from their strengths. In this paper, we propose a hybrid solution combining collaborative filtering and content-based filtering. With this aim, we have defined a new user model, called user semantic model, to model user semantic preferences based on items' features and user ratings. The user semantic model is built from the user-item model by using a fuzzy clustering algorithm: the Fuzzy C Mean (FCM) algorithm. Then, we used the user semantic model in a user-based collaborative filtering algorithm to calculate the similarity between users. Applying our approach to the MoviesLens dataset, significant improvements can be noticed comparatively to standards user-based and item-based collaborative filtering algorithms

    Extending user profiles in collaborative filtering algorithms to alleviate the sparsity problem

    Get PDF
    The overabundance of information and the related difficulty to discover interesting content has complicated the selection process for end-users. Recommender systems try to assist in this content-selection process by using intelligent personalisation techniques which filter the information. Most commonly-used recommendation algorithms are based on Collaborative Filtering (CF). However, present-day CF techniques are optimized for suggesting provider-generated content and partially lose their effectiveness when recommending user-generated content. Therefore, we propose an advanced CF algorithm which considers the specific characteristics of user-generated content (like the sparsity of the data matrix). To alleviate this sparsity problem, profiles are extended with probable future consumptions. These extended profiles increase the profile overlap probability, thereby increasing the number of neighbours used for calculating the recommendations. This way, the recommendations become more precise and diverse compared to traditional CF recommendations. This paper explains the proposed algorithm in detail and demonstrates the improvements on standard CF

    Exact and efficient top-K inference for multi-target prediction by querying separable linear relational models

    Get PDF
    Many complex multi-target prediction problems that concern large target spaces are characterised by a need for efficient prediction strategies that avoid the computation of predictions for all targets explicitly. Examples of such problems emerge in several subfields of machine learning, such as collaborative filtering, multi-label classification, dyadic prediction and biological network inference. In this article we analyse efficient and exact algorithms for computing the top-KK predictions in the above problem settings, using a general class of models that we refer to as separable linear relational models. We show how to use those inference algorithms, which are modifications of well-known information retrieval methods, in a variety of machine learning settings. Furthermore, we study the possibility of scoring items incompletely, while still retaining an exact top-K retrieval. Experimental results in several application domains reveal that the so-called threshold algorithm is very scalable, performing often many orders of magnitude more efficiently than the naive approach

    Improving the quality of the personalized electronic program guide

    Get PDF
    As Digital TV subscribers are offered more and more channels, it is becoming increasingly difficult for them to locate the right programme information at the right time. The personalized Electronic Programme Guide (pEPG) is one solution to this problem; it leverages artificial intelligence and user profiling techniques to learn about the viewing preferences of individual users in order to compile personalized viewing guides that fit their individual preferences. Very often the limited availability of profiling information is a key limiting factor in such personalized recommender systems. For example, it is well known that collaborative filtering approaches suffer significantly from the sparsity problem, which exists because the expected item-overlap between profiles is usually very low. In this article we address the sparsity problem in the Digital TV domain. We propose the use of data mining techniques as a way of supplementing meagre ratings-based profile knowledge with additional item-similarity knowledge that can be automatically discovered by mining user profiles. We argue that this new similarity knowledge can significantly enhance the performance of a recommender system in even the sparsest of profile spaces. Moreover, we provide an extensive evaluation of our approach using two large-scale, state-of-the-art online systems—PTVPlus, a personalized TV listings portal and Físchlár, an online digital video library system
    corecore