Browsing by Subject "Collaborative filtering"
  • Item
    Alternating Least Squares with Incremental Learning Bias
    ( 2015) Aung, Than Htike ; Rachsuda Jiamthapthaksin
    Recommender systems provide personalized suggestions for every individual user in the system. Many recommender systems use collaborative filtering approach in which the system collects and analyzes users' past behaviors, activities or preferences to produce high quality recommendations for the users. Among various collaborative recommendation techniques, model-based approaches are more scalable than memory-based approaches for large scale data sets in spite of large offline computation and difficulty to update the model in real time. In this paper, we introduce Alternating Least Squares with Incremental Learning Bias (ALS++) algorithm to improve over existing matrix factorization algorithms. These learning biases are treated as additional dimensions in our algorithm rather than as additional weights. As the learning process begins after regularized matrix factorization, the algorithm can update incrementally over the preference changes of the data set in constant time without rebuilding the new model again. We set up two different experiments using three different data sets to measure the performance of our new algorithm.
  • Item
    A Collaborative Filtering Recommendation Based on User Profile and User Behavior in Online Social Networks
    ( 2014) Lu, Yang ; Gopalakrishnan, Anilkumar Kothalil
    This paper aims to present and discuss the similarity among users in a social network based on CF (Collaborative Filtering) algorithm and SimRank (Similarity Based on Random Walk) algorithm. The CF algorithm used to predict the relationship between users based on the user rating on items (movies and books) and the user’s profile. The SimRank algorithm calculates the similarity among users through finding the nearest neighbors for each user in the social network. At last, the combination of these two algorithms will be used to get “people may interest each other” from users’ database. In the experimental analysis, a data set “DouBan” (a data set is collected from a Chinese website) will be used and demonstrates the performance of the improved technique with a website. And the website will be developed to show the recommended processing of the proposed algorithm. Finally, the recommendation accuracy of the proposed method is evaluated by comparing with the existing recommendation algorithms.
  • Item
    Dimension Independent Cosine Similarity for Collaborative Filtering using MapReduce
    ( 2016-02) Shen, Fei ; Rachsuda Jiamthapthaksin
    DIMSUM, an efficient and accurate all-pair similarity algorithm for real-world large scale dataset, tackles shuffle size problem of several similarity measures using MapReduce. The algorithm uses a sampling technique to reduce `power items' and preserves similarities. This paper presents an improved algorithm DIMSUM+ with a complex sampling technique to enhance DIMSUM so that it is able to further reduce `power users'. The algorithm generates k-nearest-neighbor matrix that are used in collaborative based Recommender systems. The evaluations of algorithm on MovieLens dataset with 1 million movie ratings and Yahoo! Music dataset with 700 million song ratings show significant improvement that DIMSUM+ outperforms DIMSUM at least 1.4x faster.