A Book Recommender System Using Collaborative Filtering Method

The popularity of movies has increased in recent years. There are thousands of films produced each year. These films make it challenging for movie lovers to pick the ideal film to see. We propose a recommendation system that strives to offer guidance in selecting films. Depending on the method employed, recommendation systems can be categorized into three groups: collaborative filtering, content-based filtering, and hybrid filtering. In this work, collaborative filtering, one of the methods frequently used in recommendation systems was used. There are two ways to the Collaborative Filtering approach: User-Based Collaborative Filtering (UBCF) and Item-Based Collaborative Filtering (IBCF). There are two methods for finding similar items or users: Cosine and Pearson similarities. The Cosine similarity approach is one way to determine how similar two items are. Additionally, the Pearson Correlation Coefficient approach, which determines similarities between objects by calculating linear correlations between two sets, is the most widely employed. This study aims to determine which system produces the highest item similarity in IBCF and predicted ratings to actual ratings using 90% training and 10% testing data. The data set taken from MovieLens.org consists of 943 users from 1664 movies with 99392 ratings. The MovieLens data collection will be analyzed with the RStudio and the R package recommenderlab. The results reveal that the IBCF with Cosine similarities shows the number of items recommended n top-rated movies to each user for 10 movies. The IBCF can identify the most recommended films and creates a frequency distribution of items.

Collaborative and content-based filtering are the majorly used approaches towards implementing recommender systems which can successfully predict the item(s) to be recommended to users based upon their preferences. Each of the methods has its own advantages and disadvantages that are specific to the situation they are used in. The hybrid approach aims to combine both techniques in multiple ways to optimize results and overcome shortcomings. In this paper, we propose a hybrid approach based recommendation engine to improve accuracy. While content based recommendations are made on the similarity of items’ attributes, collaborative recommendations are based on similarity of users. Collaborative filtering is achieved by matrix factorization technique. One of the most effective algorithms for matrix factorization: Singular Value Decomposition (SVD) has been used to perform collaborative filtering and combined with content based model to predict the item ratings per user. The paper aims to achieve the final result with minimum possible errors as per user preferences and recommended items.

Day to day, the uploading of data into the world wide web and e-commerce directed the development of recommender systems.Recommender system filters the information based on the user's interest.Nowadays, recommender systems are being used in every domain.The advantage of a recommender system is that it makes searching easy.Recommender systems are classified into content-based filtering, collaborative filtering and hybrid approach.In this paper, we analysed the performance of item similarity, matrix factorisation and popular recommender algorithms and evaluated with precision-recall and root mean square error metrics.

A genetic algorithms-based hybrid recommender system of matrix factorization and neighborhood-based techniques

Recommender Systems are used to mitigate the information overload problem in different domains by providing personalized recommendations for particular users based on their implicit and explicit preferences. However, Item-based Collaborative Filtering (CF) techniques, as the most popular techniques of recommender systems, suffer from sparsity and new item limitations which result in producing inaccurate recommendations. The use of items’ semantic information besides the inclusion of multi-criteria ratings can successfully alleviate such problems and generate more accurate recommendations. This paper proposes an Item-based Multi-Criteria Collaborative Filtering algorithm that integrates the items’ semantic information and multi-criteria ratings of items to lessen known limitations of the item-based CF techniques. According to the experimental results, the proposed algorithm prove to be very effective in terms of dealing with both of the sparsity and new item problems and therefore produce more accurate recommendations when compared to standard item-based CF techniques.

Purpose – Project ATHENA aims to develop an application to address information overload, primarily focused on Recommendation Systems (RSs) with the personalization and user experience design of a modern system. Method – Two machine learning (ML) algorithms were used: (1) TF-IDF for Content-based filtering (CBF); (2) Classification with Matrix Factorization- Singular Value Decomposition (SVD) applied with Collaborative filtering (CF) and mean (normalization) for prediction accuracy of the CF. Data sampling in academic Research and Development (R&D) of Philippine Council for Agriculture, Aquatic, and Natural Resources Research and Development (PCAARRD) e-Library and Project SARAI publications plus simulated data used as training sets to generate a recommendation of items that uses the three RS filtering (CF, CBF, and personalized version of item recommendations). Series of Testing and TAM performed and discussed. Results – Findings allow users to engage in online information and quickly evaluate retrieved items produced by the application. Compatibility-testing (CoT) shows the application is compatible with all major browsers and mobile-friendly. Performance-testing (PT) recommended v-parameter specs and TAM evaluations results indicate strongly associated with overall positive feedback, thoroughly enough to address the information-overload problem as the core of the paper. Conclusion – A modular architecture presented addressing the information overload, primarily focused on RSs with the personalization and design of modern systems. Developers utilized Two ML algorithms and prototyped a simplified version of the architecture. Series of testing (CoT and PT) and evaluations with TAM were performed and discussed. Project ATHENA added a UX feature design of a modern system. Recommendations – High-end hardware specs of v-Parameter are recommended, at least 8-cores of vCPU with 16GiB of memory and sufficient driver-type size to run the model and End-to-end jobs execution for continuously maintaining the application. Research Implications – Future Developers must use/integrate a large dataset. Other ML approaches can expand Hybrid-RS better. Implicit data and additional filtering methods may enhance the application in the future.

Embedding representations are a popular approach for modeling users and items in recommender systems, e.g., matrix factorization, two-tower models, or autoencoders, in which items and users are embedded in a low-dimensional, dense embedding space. On the other hand, there are methods that model high-dimensional relationships between items, most notably item-based collaborative filtering (CF), which is based on an item-to-item similarity matrix. Item-based CF was proposed over two decades ago and gained new interest through new learning methods in the form of SLIM [ 18 ] and, most recently, EASE [ 25 ]. In this work, we rephrase traditional item-based CF as sparse user encoders in which the user encoder is an (arbitrary) function and the item representation is learned. Item-based CF is a special case in which the sparse user encoding is the one-hot encoding of a user’s history. In contrast to typical dense user/item encoder models, this work targets high-dimensional and sparse user encoders. The core contribution is an efficient closed-form learning algorithm that can solve arbitrary sparse user encoders. Several applications of this algorithm are presented, including higher-order encoders, hashed encoders, and feature-based encoders.

Matrix factorization is one of the most popular techniques for prediction problems in the fields of intelligent systems and data mining. It has shown its effectiveness in many real-world applications such as recommender systems. As a collaborative filtering method, it gives users recommendations based on their previous preferences or ratings. Due to the extreme sparseness of the ratings matrix, active learning is used for eliciting ratings for a user to get better recommendations. In this paper, we propose a new matrix factorization model called Enhanced SVD ESVD which combines the classic matrix factorization method with a specific rating elicitation strategy. We evaluate the proposed ESVD method on the Movielens data set, and the experimental results suggest its effectiveness in terms of both accuracy and efficiency, when compared with traditional matrix factorization methods and active learning methods.

Collaborative filtering algorithms, such as matrix factorization techniques, are recently gaining momentum due to their promising performance on recommender systems. However, most collaborative filtering algorithms suffer from data sparsity. Active learning algorithms are effective in reducing the sparsity problem for recommender systems by requesting users to give ratings to some items when they enter the systems. In this paper, a new matrix factorization model, called Enhanced SVD (ESVD) is proposed, which incorporates the classic matrix factorization algorithms with ratings completion inspired by active learning. In addition, the connection between the prediction accuracy and the density of matrix is built to further explore its potentials. We also propose the Multi-layer ESVD, which learns the model iteratively to further improve the prediction accuracy. To handle the imbalanced data sets that contain far more users than items or more items than users, the Item-wise ESVD and User-wise ESVD are presented, respectively. The proposed methods are evaluated on the famous Netflix and Movielens data sets. Experimental results validate their effectiveness in terms of both accuracy and efficiency when compared with traditional matrix factorization methods and active learning methods.

Cooking your own food at home is a good step toward reducing fast food consumption. Fast food increases the risk of dangerous diseases. The diversity of recipe information available on the internet makes it difficult to choose recipes that match user preferences. Mobile technology can help with this by recommending recipes that better suit users' eating habits. This makes the transition to a healthier diet easier. Therefore, in this study, a recommendation system was developed that can recommend recipes based on the preferences of Android users. Two main recommendation methods are used in this study: content-based filtering and collaborative filtering. Using cosine similarity, a content-based recommendation system identifies the proximity between a recipe for food and its related context. The history of user comments on recipes serves as implicit feedback for the collaborative recommendation algorithm. This eliminates the need for explicit evaluations, such as ratings. This recommendation system generates recommendations in the form of the top ten food recipes with an evaluation matrix, referred to as NDCG@k and Hit-Ratio@k. The tests revealed that a content-based filtering technique may produce helpful recommendations, with the highest similarity score of 0.41 for the entry "chocolate cake that you can easily make at home." Meanwhile, in the collaborative filtering method using the Neural Collaborative Filtering (NCF) approach, the system shows consistent performance improvements, with the MAP@10 value increasing from 0.705 to 0.767 and the NDCG@10 from 0.78 to 0.83 after 10 training epochs. Keywords: Recommendation systems; content-based filtering; neural collaborative filtering; cosine similarity; implicit feedback

Recommender systems have become essential in the digital era to help users navigate overwhelming content. This study develops a book recommendation system using three collaborative filtering methods: user-based, item-based, and matrix factorization using singular value decomposition. We evaluate the system on a real-world dataset of 1,149,780 book ratings from 278,858 users across 271,360 books. A subset of 500 active users is used for experimental evaluation. The models are assessed using root mean square error and mean absolute error to measure rating prediction accuracy. The results show that the item-based collaborative filtering method achieves the best accuracy (root mean square error 7.362; mean absolute error 6.761), slightly outperforming the user-based approach (7.365; 6.809) and the matrix factorization method (7.643; 7.413). We analyze the results to understand the performance differences, noting the stability of item similarity as a key factor and the need for optimal tuning in the matrix factorization model. In conclusion, item-based collaborative filtering proved most effective for this context. This work provides insights into the comparative performance of foundational recommendation techniques and highlights practical considerations for improving book recommender systems.

When we buy items in online stores, it is common to face recommended items that meet our interest. These recommendation system help users not only to find out related items, but also find new things that may interest users. Recommendation system has been widely studied and various models has been suggested such as, collaborative filtering and content-based filtering. Though collaborative filtering shows good performance for predicting users preference, there are some conditions where collaborative filtering cannot be applied. Sparsity in user data causes problems in comparing users. Systems which are newly starting or companies having small number of users are also hard to apply collaborative filtering. Content-based filtering should be used to support this conditions, but content-based filtering has some drawbacks and weakness which are tendency of recommending similar items, and keeping history of a user makes recommendation simple and not able to follow up users preference changes. To overcome this drawbacks and limitations, we suggest weighted window assisted user history based recommendation system, which captures user’s purchase patterns and applies them to window weight adjustment. The system is capable of following current preference of a user, removing useless recommendation and suggesting items which cannot be simply found by users. To examine the performance under user and data sparsity environment, we applied data from start-up trading company. Through the experiments, we evaluate the operation of the proposed recommendation system.

The recommendation system is an application model based on observations of the circumstances and customer desires. In the recommendation system, several methods are used to support how the system works in producing information. One method of recommendation system that is quite popular is the method Hybrid. Several researchers have successfully applied this method in developing a tourism recommendation system, therefore to achieve the goal of implementing a tourism recommendation, it is better to take advantage of a marketing technique such as promotion in order to increase sales and attract more comprehensive customers. Therefore, a literature review on the method hybrid (Collaborative Filtering & Content-Based Filtering) of this travel recommendation system is carried out to collaborate between methods, algorithms, and a tool or media marketing applied in a recommendation system.

Recommender systems are collecting and analyzing user data to provide better user experience. However, several privacy concerns have been raised when a recommender knows user's set of items or their ratings. A number of solutions have been suggested to improve privacy of legacy recommender systems, but the existing solutions in the literature can protect either items or ratings only. In this paper, we propose a recommender system that protects both user's items and ratings. For this, we develop novel matrix factorization algorithms under local differential privacy (LDP). In a recommender system with LDP, individual users randomize their data themselves to satisfy differential privacy and send the perturbed data to the recommender. Then, the recommender computes aggregates of the perturbed data. This framework ensures that both user's items and ratings remain private from the recommender. However, applying LDP to matrix factorization typically raises utility issues with i) high dimensionality due to a large number of items and ii) iterative estimation algorithms. To tackle these technical challenges, we adopt dimensionality reduction technique and a novel binary mechanism based on sampling. We additionally introduce a factor that stabilizes the perturbed gradients. With MovieLens and LibimSeTi datasets, we evaluate recommendation accuracy of our recommender system and demonstrate that our algorithm performs better than the existing differentially private gradient descent algorithm for matrix factorization under stronger privacy requirements.

Abstract—Recommender systems are often used to provide useful recommendations for users. They use previous history of the users-items interactions, e.g. purchase history and/or users rating on items, to provide a suitable recommendation list for any target user. They may also use contextual information available about items and users. Collaborative filtering algorithm and its variants are the most successful recommendation algorithms that have been applied to many applications. Collaborative filtering method works by first finding the most similar users (or items) for a target user (or items), and then building the recommendation lists. There is no unique evaluation metric to assess the performance of recommendations systems, and one often choose the one most appropriate for the application in hand. This paper compares the performance of a number of well-known collaborative filtering algorithms on movie recommendation. To this end, a number of performance criteria are used to test the algorithms. The algorithms are ranked for each evaluation metric and a rank aggregation method is used to determine the wining algorithm. Our experiments show that the probabilistic matrix factorization has the top performance in this dataset, followed by item-based and user-based collaborative filtering. Non-negative matrix factorization and Slope 1 has the worst performance among the considered algorithms.
 Keywords—Social networks analysis and mining, big data, recommender systems, collaborative filtering.