Collaborative Filtering Approach Research Articles

A Recommendation Engine for Predicting Movie Ratings Using a Big Data Approach

In this era of big data, the amount of video content has dramatically increased with an exponential broadening of video streaming services. Hence, it has become very strenuous for end-users to search for their desired videos. Therefore, to attain an accurate and robust clustering of information, a hybrid algorithm was used to introduce a recommender engine with collaborative filtering using Apache Spark and machine learning (ML) libraries. In this study, we implemented a movie recommendation system based on a collaborative filtering approach using the alternating least squared (ALS) model to predict the best-rated movies. Our proposed system uses the last search data of a user regarding movie category and references this to instruct the recommender engine, thereby making a list of predictions for top ratings. The proposed study used a model-based approach of matrix factorization, the ALS algorithm along with a collaborative filtering technique, which solved the cold start, sparse, and scalability problems. In particular, we performed experimental analysis and successfully obtained minimum root mean squared errors (oRMSEs) of 0.8959 to 0.97613, approximately. Moreover, our proposed movie recommendation system showed an accuracy of 97% and predicted the top 1000 ratings for movies.

Discretization Based Framework to Improve the Recommendation Quality

Recommendation systems are information filtering software that delivers suggestions about relevant stuff from a massive collection of data. Collaborative filtering approaches are the most popular in recommendations. The primary concern of any recommender system is to provide favorable recommendations based on the rating prediction of user preferences. In this article, we propose a novel discretization based framework for collaborative filtering to improve rating prediction. Our framework includes discretization-based preprocessing, chi-square based attribution selection, and K-Nearest Neighbors (KNN) based similarity computation. Rating prediction affords some basis for the judgment to decide whether recommendations are generated or not, subject to the ratio of performance of any recommendation system. Experiments on two datasets MovieLens and BookCrossing, demonstrate the effectiveness of our method.

Rec-CFSVD++: Implementing Recommendation System Using Collaborative Filtering and Singular Value Decomposition (SVD)++

In recommender systems, Collaborative Filtering (CF) plays an essential role in promoting recommendation services. The conventional CF approach has limitations, namely data sparsity and cold-start. The matrix decomposition approach is demonstrated to be one of the effective approaches used in developing recommendation systems. This paper presents a new approach that uses CF and Singular Value Decomposition (SVD)[Formula: see text] for implementing a recommendation system. Therefore, this work is an attempt to extend the existing recommendation systems by (i) finding similarity between user and item from rating matrices using cosine similarity; (ii) predicting missing ratings using a matrix decomposition approach, and (iii) recommending top-N user-preferred items. The recommender system’s performance is evaluated considering Root Mean Square Error (RMSE) and Mean Absolute Error (MAE). Performance evaluation is accomplished by comparing the systems developed using CF in combination with six different algorithms, namely SVD, SVD[Formula: see text], Co-Clustering, KNNBasic, KNNBaseline, and KNNWithMeans. We have experimented using MovieLens 100[Formula: see text]K, MovieLens 1[Formula: see text]M, and BookCrossing datasets. The results prove that the proposed approach gives a lesser error rate when cross-validation ([Formula: see text]) is performed. The experimental results show that the lowest error rate is achieved with MovieLens 100[Formula: see text]K dataset ([Formula: see text], [Formula: see text]). The proposed approach also alleviates the sparsity and cold-start problems and recommends the relevant items.

Building Recommendation Systems Using the Algorithms KNN and SVD

<p>Recommendation systems are used successfully to provide items (example:<br />movies, music, books, news, images) tailored to user preferences.<br />Among the approaches proposed, we use the collaborative filtering approach<br />of finding the information that satisfies the user by using the<br />reviews of other users. These ratings are stored in matrices that their<br />sizes increase exponentially to predict whether an item is interesting<br />or not. The problem is that these systems overlook that an assessment<br />may have been influenced by other factors which we call the cold start<br />factor. Our objective is to apply a hybrid approach of recommendation<br />systems to improve the quality of the recommendation. The advantage<br />of this approach is the fact that it does not require a new algorithm<br />for calculating the predictions. We we are going to apply the two Kclosest<br />neighbor algorithms and the matrix factorization algorithm of<br />collaborative filtering which are based on the method of (singular value<br />decomposition).</p>

A New Collaborative Filtering Approach Based on Game Theory for Recommendation Systems

Recommendation systems can help internet users to find interesting things that match more with their profile. With the development of the digital age, recommendation systems have become indispensable in our lives. On the one hand, most of recommendation systems of the actual generation are based on Collaborative Filtering (CF) and their effectiveness is proved in several real applications. The main objective of this paper is to improve the recommendations provided by collaborative filtering using clustering. Nevertheless, taking into account the intrinsic relationship between users can enhance the recommendations performances. On the other hand, cooperative game theory techniques such as Shapley Value, take into consideration the intrinsic relationship among users when creating communities. With that in mind, we have used SV for the creation of user communities. Indeed, our proposed algorithm preforms into two steps, the first one consists to generate communities user based on Shapley Value, all taking into account the intrinsic properties between users. It applies in the second step a classical collaborative filtering process on each community to provide the Top-N recommendation. Experimental results show that the proposed approach significantly enhances the recommendation compared to the classical collaborative filtering and k-means based collaborative filtering. The cooperative game theory contributes to the improvement of the clustering based CF process because the quality of the users communities obtained is better.

Experimental Analysis of Friend-And-Native Based Location Awareness for Accurate Collaborative Filtering

Location-based recommender systems have gained a lot of attention in both commercial domains and research communities where there are various approaches that have shown great potential for further studies. However, there has been little attention in previous research on location-based recommender systems for generating recommendations considering the locations of target users. Such recommender systems sometimes recommend places that are far from the target user’s current location. In this paper, we explore the issues of generating location recommendations for users who are traveling overseas by taking into account the user’s social influence and also the native or local expert’s knowledge. Accordingly, we have proposed a collaborative filtering recommendation framework called the Friend-And-Native-Aware Approach for Collaborative Filtering (FANA-CF), to generate reasonable location recommendations for users. We have validated our approach by systematic and extensive experiments using real-world datasets collected from Foursquare TM. By comparing algorithms such as the collaborative filtering approach (item-based collaborative filtering and user-based collaborative filtering) and the personalized mean approach, we have shown that our proposed approach has slightly outperformed the conventional collaborative filtering approach and personalized mean approach.

Collaborative filtering based on multiple attribute decision making

ABSTRACT To address the sparsity problem, a novel collaborative filtering approach based on multiple attribute decision making (MADM-CF) is proposed. In MADM-CF, users in collaborative filtering are treated as decision alternatives, items are treated as attributes. The weight of each item is determined, and the preference similarities between the active user and other users are computed. The preference similarity means that how the users’ preferences are similar on positive ratings and negative ratings. According to the preference similarities, the candidate neighbourhood of the active user is determined. A method to compute overall assessment value is designed, the overall assessment value of each user in the candidate neighbourhood is computed, and users with the smallest overall assessment values are selected as the active user’s nearest neighbours. Finally, the most frequent item recommendation method (MFIR) is used to provide top-N recommendations to the active user. Experimental results based on MovieLens and Netflix datasets show that the proposed approach is superior to existing alternatives.

Neural Collaborative For Music Recommendation System

In music there are various types of genres and every person has their own choice of the type of music they want to hear. Recommendation system is an important feature in an application, especially with the large number of choices for a particular item. With a good recommendation system, users will be helped by the suggestions given and can improve the user experience of the application. It is better provided by using collaborative filtering (CF) approach by recommending products related to one’s preferences history. However, CF approach still lacking in integrating complex users data. Therefore, hybrid technique could be the solution to polish the CF approach. Combining neural network and CF also called NCF thought to be better than CF alone. This study focuses on collaborative filtering approach combined with neural network or called neural collaborative filtering. In this study, we use 20,000 users, 6,000 songs, and 470,000 transaction ratings then predict the score using CF and NCF approach. The aim of this study is to differentiate recommendation systems with the use of CF alone and NCF. Through this research, it was found that NCF is better than user-based collaborative filtering in gather those playlist they really want to hear, but requires more time to build it.

Evaluation of Collaborative Filtering for Recommender Systems

Recently, due to the increasing amount of data on the Internet along with the increase in products’ purchasing via e-commerce websites, Recommender Systems (RS) play an important role in guiding customers to buy products they may prefer. Furthermore, these systems help the companies to advertise their products to the most potential customers, and therefore raise their revenues. Collaborative Filtering (CF) is the most popular RS approach. It is classified into memory-based and model-based filtering. Memory-based filtering is in turn classified into user-based and item-based. Several algorithms have been proposed for CF. In this paper, a comparison has been performed between different CF algorithms to assess their performance. Specifically, we evaluated K-Nearest Neighbor (KNN), Slope One, co-clustering and Non-negative Matrix Factorization (NMF) algorithms. KNN algorithm is representative of the memory-based CF approach (both user-based and item-based). The other three algorithms, on the other hand, are under the model-based CF approach. In our experiments, we used a popular MovieLens dataset based on six evaluation metrics. Our results reveal that the KNN algorithm for item-based CF outperformed all other algorithms examined in this paper.

Collaborative Deep Forest Learning for Recommender Systems

Collaborative filtering (CF) is one of the most practical approaches on recommendation systems by predicting users' preferences for items based on the user-item interaction information. Besides the connections between users and items, social networks among users can provide auxiliary information to improve the performance of recommender systems. Here, we propose an end-to-end deep learning framework by learning latent social features to embed in a CF approach. First, representation learning is employed on the rating matrix to extract the latent social features. Then, a novel deep learning approach based on cascade tree forest is used in the recommendation process. Experiments on real-world datasets from different domains demonstrate that the proposed Collaborative Deep Forest Learning (CDFL) outperforms the state-of-the-art CF recommendation methods.

A Hybrid Personalized Scientific Paper Recommendation Approach Integrating Public Contextual Metadata

Rapid increase in scholarly publications on the web has posed a new challenge to the researchers in finding highly relevant and important research articles associated with a particular area of interest. Even a highly relevant paper is sometimes missed especially for novice researchers due to lack of knowledge and experience in finding and accessing the most suitable articles. Scholarly recommender system is a very appropriate tool for this purpose that can enable researchers to locate relevant publications easily and quickly. However, the main downside of the existing approaches is that their effectiveness is dependent on priori user profiles and thus, they cannot recommend papers to the new users. Furthermore, the system uses both public and non-public metadata and therefore, the system is unable to find similarities between papers efficiently due to copyright restrictions. Considering the above challenges, in this research work, a novel hybrid approach is proposed that separately combines a Content Based Filtering (CBF) recommender module and a Collaborative Filtering (CF) recommender module. Unlike previous CBF and CF approaches, public contextual metadata and paper-citation relationship information are effectively incorporated into these two approaches separately to enhance the recommendation accuracy. In order to verify the effectiveness of the proposed approach, publicly available datasets were employed. Experimental results demonstrate that the proposed approach outperforms the baseline approaches in terms of standard metrics (precision, recall, F1-measure, mean average precision, and mean reciprocal rank), indicating that the proposed approach is more efficient in recommending scholarly publications.

Hybrid image recommendation algorithm combining content and collaborative filtering approaches

The paper relates to the subject field of image recommender systems. The proposed approach of automatic image recommendation addresses the following shortcomings of existing solutions: manual input of metadata by users, the lack of user rating history consideration, significant computational resources. The main idea of the proposed approach is to recognize object classes from images using a convolutional neural network to make recommendations. In the proposed solution users and images are located in the semantic space represented by a graph. Software implementation of the proposed approach and obtained results are considered.

Contribution of Collaborative Filtering Approach on Environmental Big Data Analytics Context

In recent years and following the spread of internet using, the way of life in our society as well as the management of the main production sectors have changed towards digitalization (E-Commerce, E-Surgery, road traffic management, etc.) to minimize the. This change challenged researchers and organizations to come up with solutions to manage, maintain, classify and make the best decision from the gigantic flows of data created daily while reducing environmental Damage (Consumption of Energical resources….), From which was born the Collaborative filtering approach which facilitate decision making based on the experience feedback of Internet users. This approach is used generally the big Data Analytics Algorithm to predict and classify data

Strategies of similarity propagation in web service recommender systems.

Recently, web service recommender systems have attracted much attention due to the popularity of Service-Oriented Computing and Cloud Computing. Memory-based collaborative filtering approaches which mainly rely on the similarity calculation are widely studied to realize the recommendation. In these research works, the similarity between two users is computed based on the QoS data of their commonly-invoked services and the similarity between two services is computed based on the common users who invoked them. However, most approaches ignore that the similarity calculation is not always accurate under a sparse data condition. To address this problem, we propose a similarity propagation method to accurately evaluate the similarities between users or services. Similarity propagation means that "if A and B are similar, and B and C are similar, then A and C will be similar to some extent". Firstly, the similarity graph of users or services is constructed according to the QoS data. Then, the similarity propagation paths between two nodes on the similarity graph are discovered. Finally, the similarity along each propagation path is measured and the indirect similarity between two users or services is evaluated by aggregating the similarities of different paths connecting them. Comprehensive experiments on real-world datasets demonstrate that our similarity propagation method can outstandingly improve the QoS prediction accuracy of memory-based collaborative filtering approaches.

Intelligent recommender system based on unsupervised machine learning and demographic attributes

Recommendation systems aim to predict users interests and recommend items most likely to interest them. In this paper, we propose a new intelligent recommender system that combines collaborative filtering (CF) with the popular unsupervised machine learning algorithm K-means clustering. Also, we use certain user demographic attributes such as the gender and age to create segmented user profiles, when items (movies) are clustered by genre attributes using K-means and users are classified based on the preference of items and the genres they prefer to watch. To recommend items to an active user, Collaborative Filtering approach then is applied to the cluster where the user belongs. Following the experimentation for well known movies, we show that the proposed system satisfies the predictability of the CF algorithm in GroupLens. In addition, our proposed system improves the performance and time response speed of the traditional collaborative Filtering technique and the Content-Based technique too.

Neural graph personalized ranking for Top-N Recommendation

Personalized recommendation has been widely applied to many real-world services. Many of recent studies focus on collaborative filtering (CF) by deep neural networks, which pursue to predict users’ preference on items based on the past user–item interactions (e.g., a user rates an item). A general CF approach consists of two key modules, embedding representation learning and interaction modeling. In most existing methods, the embedding module is followed by the interaction modeling module, and the user–item interaction information is only emploited in interaction modeling directly. Existing methods, however, defectively overlook the correlation between users and items, as well as the inherent connection between embedding learning and the interaction information. To fill this gap, we propose neural graph personalized ranking (NGPR) which directly makes use of the user–item interaction information in embedding learning by incorporating the user–item interaction graph in embedding learning. Specifically, we construct the user–item interaction graph using de facto interaction between a user and an item. Correlation between users and items can also be reserved by concatenating representations of users and items in the entire procedure of embedding learning. Moreover, more complicated structures like multilayer perceptron (MLP) can be used in interaction modeling to make the most use of the representations, rather than simple linear transformation. We conduct extensive experiments on three public benchmarks and demonstrate the superior performance of the proposed NGPR model on personalized ranking task. In addition, our ablation studies verify that our novel design to incorporate the user–item interaction graph in embedding learning is effective.

Various Implementation of Collaborative Filtering-Based Approach on Recommendation Systems using Similarity

The Recommendation System plays an increasingly important role in our daily lives. With the increasing amount of information on the internet, the recommendation system can also solve problems caused by increasing information quickly. Collaborative filtering is one method in the recommendation system that makes recommendations by analyzing correlations between users. Collaborative filtering accumulates customer item ratings, identifies customers with common ratings, and offers recommendations based on inter-customer comparisons. This study aims to build a system that can provide recommendations to users who want to order or choose fast food menus. This recommendation system provides recommendations based on item data calculations with customer review data using a collaborative filtering approach. The results of applying cosine similarity calculation to determine fast food menu recommendations obtained for the item-based recommendation is Pizza Frankfurter BBQ Large with a value of 1.0, item-based with genre recommendation is Calblend Float with value 1.0 and user-based recommendation is Pizza Black Pepper Beef / Chicken Large with mean score 2.5.

When contextual information meets recommender systems: extended SVD++ models

ABSTRACT Collaborative filtering approach is widely used in the area of recommender systems. In fact, its predictive accuracy is supported by a large amount of additional information available on the internet, especially in social media. Singular Value Decomposition (SVD) is the most used matrix factorization method in the field of collaborative filtering, which is realized by using a latent factor vector of items and another one of users and introduces the users and item bias information. SVD++ is a derivation of the SVD model. It aims at adding implicit feedback information that is why the results of this model are improved. In this paper, different contributions are applied to SVD++ model through three different approaches which apply modification of latent factor vector while taking into account social and environmental information. Moreover, the experimental results showed that these proposed extensions ameliorate the prediction accuracy in terms of MAE and RMSE compared to SVD++ corresponding to four benchmarks, which are CiaoDVD, Food data, Adom data and Movielens-100k. According to the four used data sets, the experimental results showed that our proposed third contribution is effective in improving the prediction accuracy by 3.7%, 8.2%, 46.7% and 4%, respectively. These results also showed a reduction of the Mean Absolute Error by 0.0.71, 0.125, 0.61 and 0.038. Similar results were also obtained with the first and the second contribution.

Effective contact recommendation in social networks by adaptation of information retrieval models

We investigate a novel perspective to the development of effective algorithms for contact recommendation in social networks, where the problem consists of automatically predicting people that a given user may wish or benefit from connecting to in the network. Specifically, we explore the connection between contact recommendation and the text information retrieval (IR) task, by investigating the adaptation of IR models (classical and supervised) for recommending people in social networks, using only the structure of these networks.We first explore the use of adapted unsupervised IR models as direct standalone recommender systems. Seeking additional effectiveness enhancements, we further explore the use of IR models as neighbor selection methods, in place of common similarity measures, in user-based and item-based nearest-neighbors (kNN) collaborative filtering approaches. On top of this, we investigate the application of learning to rank approaches borrowed from text IR to achieve additional improvements.We report thorough experiments over data obtained from Twitter and Facebook where we observe that IR models, particularly BM25, are competitive compared to state-of-the art contact recommendation methods. We provide further empirical analysis of the additional effectiveness that can be achieved by the integration of IR models into kNN and learning to rank schemes. Our research shows that the IR models are effective in three roles: as direct contact recommenders, as neighbor selectors in collaborative filtering and as samplers and features in learning to rank.

Improving Matrix Factorization Based Expert Recommendation for Manuscript Editing Services by Refining User Opinions with Binary Ratings

As language editing became an essential process for enhancing the quality of a research manuscript, there are several companies providing manuscript editing services. In such companies, a manuscript submitted for proofreading is matched with an editing expert through a manual process, which is costly and often subjective. The major drawback of the manual process is that it is almost impossible to consider the inherent characteristics of a manuscript such as writing style and paragraph composition. To this end, we propose an expert recommendation method for manuscript editing services based on matrix factorization, a well-known collaborative filtering approach for learning latent information in ordinal ratings given by users. Specifically, binary ratings are utilized to substitute ordinal ratings when negative opinions are expressed by users since negative opinions are more accurately expressed by binary ratings than ordinal ratings. From the experiments using a real-world dataset, the proposed method outperformed the rest of the compared methods with an RMSE (root mean squared error) of 0.1. Moreover, the effectiveness of substituting ordinal ratings with binary ratings was validated by conducting sentiment analysis on text reviews.