Ensemble Learning Based Collaborative Filtering with Instance Selection and Enhanced Clustering

An effective collaborative movie recommender system with cuckoo search

Recommender systems play an important role in most modern e-commerce applications. They have allowed users to become aware of the myriad choices available to them. The ease of information and the abundance of options have helped users make educated decisions. A recommender system studies a user's preferences and continues learning the user's changing interests, so as to suggest items that incline with the user's interests. In cases where a user is new to the application, or the user prefers not to discourse preferences, the recommender system is unable to gather the user's preference on any item. This is called the cold start problem; wherein the system can make valid recommendations only once the user starts informing the system about his/her choices. In this paper, we discuss the challenges faced by the cold start problem and how this problem may be alleviated using social media. We suggest an approach where we collect public information from users' social media accounts and analyze this information to understand their preferences. In particular, we gather the new user's information using their Twitter profile; i.e., the user's interest and preferences are extracted from his/her Twitter profile by analyzing his/her tweets. These interests will help the system understand what kind of movies the user will be most interested in. We compare these preferences with the metadata about the individual items. Using this approach, we develop a movie recommendation system wherein we produce top-N movie recommendations for a user. We used the MovieTweetings dataset to model the application. Two sets of results have been produced. In the first, smaller set of 770 users, 72.67% of users have received 100% accurate movie recommendations while nearly 80% of users got more than 75% accuracy. For the second, larger set of more than 3,500 users, 53 % of users have received 100% accurate recommendations while 72% of users got more than 75% accuracy. These encouraging results have demonstrated that the approach is effectively in alleviating cold start problems in recommendation systems, and may be applicable to many other e-commerce applications.

Collaborative filtering (CF), a technique used by recommendation systems, predicts and recommends items (information, products or services) that the user might like. Amazon.com's recommender system is one of the most famous examples of CF. Recommendation systems are popular in both commercial and research sectors, and they are applied in a variety of applications such as movies, music, books, social connections and venues. In particular, movie recommendation systems produce personal recommendations for movies. Existing CF algorithms employed in movie recommendation systems predict the unknown rating of a given user for a movie using only the ratings (i.e., preferences) of other like-minded users who have seen the movie. In such approaches, there exist certain limits in improving the accuracy of recommendation systems. This paper proposes an algorithm for movie recommendation that exploits the genre of the movie to enhance the accuracy of rating predictions. The proposed algorithm 1) numerically measures the correlation between movie genres using movie rating information; 2) classifies movies using the genre correlations and generates a list of recommended movies for the target user with the classified movies; and finally 3) predicts the ratings of the movies in the list using traditional CF algorithms. The experimental results show that the proposed algorithm yields higher accuracy in movie rating predictions than existing movie recommendation algorithms.

This paper discusses the design and evaluation of a Neural Collaborative Filtering (NCF) model for movie recommendations using the MovieLens dataset. It addresses the limitations of traditional recommendation systems, such as content-based filtering and collaborative filtering, which struggle with data sparsity and the cold start problem. By incorporating deep learning, the NCF model enhances the accuracy and personalization of recommendations by learning the latent features of users and items and capturing complex interactions.

Recommender Systems are mainly used in various e-commerce applications, especially online stores threatening users’ privacy. The privacy issues can be overcome by using security solutions, which include blockchain technology for privacy applications. The fusion of the Internet of Things and blockchain technology has fully improved modern distributed systems. The combination guarantees the safety and scalability of the recommender system. We aim to create an authorized secure exchange device using blockchain-enabled multiparty computation by adding smart contracts to the core blockchain protocol. The recommendation structure and Blockchain technology make online shopping more convenient and private. We propose a blockchain-related recommender system using the “movielens” data. The case study includes a smart contract model that recommends movies to buyers. Initially, we tested the model on a small “movielens dataset” and extended it to a 3M movielens dataset. We developed a classifier model for movielens and proposed a Dual light graph convolutional network for movielens data classification. Our results, including ablation analysis, show that blockchain strategies and Dual light graph convolutional networks can effectively improve recommender systems’ privacy. Furthermore, the suggested blockchain technique can be stretched by similar procedures.

Recently, the demand for online and offline recommendation systems has increased drastically. These systems are widely used in tourism, music, and video or movie recommendations. Currently, online movie streaming applications have gained huge attention. Providing better recommendations to the user is a challenging task for these applications. The content-based filtering (CBF) recommender system is a promising technique for these systems. However, traditional systems suffer from challenges such as cold-start problems, sparsity, and scalability. Consequently, we strengthen content-based recommendation algorithms by enriching the user-related and relevant product models with effective tendencies. The majority of previous work on classifiers has been in recommendation systems. To overcome these issues, we present a deep learning model that uses a deep neural network mechanism and a multiplicative BiLSTM model. This scheme uses embedding, weight updating, and preference learning processes to improve the recommendation system's performance. The performance of the proposed approach is measured in terms of MAE, MAP, Precision, Recall, and F-measure. The comparative performance shows that the proposed approach achieves better performance when compared with state-of-art movie recommendation techniques.

The necessity for sophisticated recommender systems in the movie recommendation sphere has become particularly pronounced, generating a more personalized movie recommendation due to people nowadays who like to watch movies online. Efficient recommender systems make use of advanced machine learning (ML) techniques in the pursuit of accurate and meaningful recommendations. This paper endeavours to give a comprehensive overview of technologies known as recommender systems, concentrating on ML methods found at the base. Different strategies have been applied in this work, which include collaborative filtering (CF), content-based filtering (CB), hybrid approaches, Generative AI and so on. The merits and demerits of each technique are listed and explained briefly. In addition, the actual application’s results are also presented in this paper. To evaluate the performance of the techniques, some of the important datasets that are used in evaluating recommender systems are also discussed along with measurement metrics to determine the effectiveness of technique. Example metrics used are Root Mean Square Error (RMSE), Mean Absolute Error (MAE) and so on. This paper synthesizes existing research to evaluate the advantages and limitations of diverse recommendation techniques, which aims to give suggestion on how to improve the design of movie recommendation systems so that the performance of the technique can be improved.

As an efficient information filtering tool, the recommendation system can help users obtain valuable information quickly and efficiently while effectively alleviating the information load problem. However, the classic collaborative filtering algorithm has data sparsity problems in practical applications, which affects the accuracy of recommendation. To solve this problem, this paper took movie recommendation as the research object and proposed a hybrid recommendation algorithm named K-GBDT which combined KNN and gradient boosting decision tree. Firstly, it used KNN to obtain the similar information of the target user and item for preliminary prediction. At the same time, it mined users' basic information features and potential features of users and items from the original data. Then, it tried to adopt XGBoost, LightGBM and CatBoost algorithm which were proposed base the idea of gradient boosting decision tree to build regression model. Finally, the target user's rating for the movie was predicted with the trained model, and the recommendation list was generated based on the predicted results. Compared with some classic recommendation algorithms such as NMF, Slope One, Co-Clustering and etc. Based on MovieLens datasets, results show that the mean absolute error and root mean square error of this algorithm are both low, and its recommendation accuracy is higher.

Evaluation Of Recommendation System On A Movie Dataset

Recommendation systems (RSs) are tools for interacting with large and complex information spaces. They provide a personalized view of such spaces, prioritizing items likely to be of interest to the user. The main objective of RSs is to tool up users with desired items that meet their preferences. A major problem in RSs is called: “cold-start”; it is a potential problem called so in computer-based information systems which comprises a degree of automated data modeling. Particularly, it concerns the issue in which the system cannot draw any inferences nor have it yet gathered sufficient information about users or items. Since RSs performance is substantially limited by cold-start users and cold-start items problems; this research study takes the route for a major aim to attenuate users’ cold-start problem. Still in the process of researching, sundry studies have been conducted to tackle this issue by using clustering techniques to group users according to their social relations, their ratings or both. However, a clustering technique disregards a variety of users’ tastes. In this case, the researcher has adopted the overlapping technique as a tool to deal with the clustering technique’s defects. The advantage of the overlapping technique excels over others by allowing users to belong to multi-clusters at the same time according to their behavior in the social network and ratings feedback. On that account, a novel overlapping method is presented and applied. This latter is executed by using the partitioning around medoids (PAM) algorithm to implement the clustering, which is achieved by means of exploiting social relations and confidence values. After acquiring users’ clusters, the average distances are computed in each cluster. Thereafter, a content comparison is made regarding the distances between every user and the computed distances of the clusters. If the comparison result is less than or equal to the average distance of a cluster, a new user is added to this cluster. The singular value decomposition plus (SVD[Formula: see text]) method is then applied to every cluster to compute predictions values. The outcome is calculated by computing the average of mean absolute error (MAE) and root mean square error (RMSE) for every cluster. The model is tested by two real world datasets: Ciao and FilmTrust. Ultimately, findings have exhibited a great deal of insights on how the proposed model outperformed a number of the state-of-the-art studies in terms of prediction accuracy.

The movie recommender system has an important role in providing movie recommendations for users, but new users have difficulty choosing movies that are given by the recommender system because of the cold start problem. This study aims to overcome the cold start problem using a knowledge-based recommender system, i.e association rule mining using an apriori algorithm. The apriori algorithm aims to extract correlations between product itemsets, but the problem in the apriori algorithm is the large number of association rules that make the complex computation. To overcome this problem, we combine the apriori algorithm and k-means to produce more accurate recommendations, because the items are grouped before the recommendation process using the k-means algorithm. In this study, we use a dataset of movies and ratings from the Kaggle website. This study uses a minimum value of 0.5 confidence, and a minimum value of 4 lifts. To produce the best itemset in the form of antecedents and consequents of the Beauty and the Beast item with The Passion of Joan of Arc which has a value of 0.107981 support, 0.779661 confidence, 4.151695 lift

The increasing demand for personalized information has resulted in the development of the Recommender System (RS). RS has been widely utilized and broadly studied to suggest the interests of users and make an appropriate recommendation. This paper gives an overview of several types of recommendation approaches based on user preferences, ratings, domain knowledge, users demographic data, users context and also lists the advantages and disadvantages of each RS approach. In this paper, we also proposed the movie recommendation based on collaborative filtering and singular value decomposition plus-plus (SVD++). The proposed approach is compared with well-known machine learning approaches namely k nearest neighbor (K-NN), singular value decomposition (SVD) and Co-clustering. The proposed approach is experimentally verified using MovieLens 100 K datasets and error of the RS is measured using Root Mean Square Error (RMSE) and Mean Absolute Error (MAE). The result shows that the proposed approach gives a lesser error rate with RMSE (0.9201) and MAE (0.7219). This approach also overcomes cold-start, data sparsity problems and provides them relevant items and services.

Recommendation systems are an important feature in the proposed virtual life, where users are often stuck with choices most of the time and need help to be able to find what they are looking for. In this work, contentbased techniques have been employed in the proposed recommender system in two ways, a deep review for content and features contents such as (cast, crew, keywords, and genres) has been conducted. A preprocessing stage using TF-IDF and CountVectorizer methods have been employed efficiently to prepare the dataset for any similarity measurements. Cosine similarity algorithm has been employed as well with and without sigmoid and linear kernals. The achieved result proves that similarities between movies using TF-IDF with - Cosine similarity (sigmoid kernel) overcomes the TF-IDF with - Cosine similarity (linear_kernel) and Cosine similarity with CountVectorizer in collaborative filtering. The accuracy values of different machine learning models are validated with K-fold Cross Validator techniques. The performance evaluation has been measured using ROOT Mean Square Error and Mean Absolute Error. Five Machine learning algorithms (NormalPredictor, SVD, KNNBasic (with k=20 and K=10), KNNBasic (with sim_options), and NMF (in several rating scales)). Accuracies are finally been validated with 3 folds from each validator. The best achieved RMSE and MAE scores are using SVD (RMSE = 90%) and (MAE = 69%), followed by KNNBasic (with sim_options, K= 20), NMF, KNNBasic (K=20), KNNBasic (K=10), ending with KNNBasic(sim_options, K= 10). Keywords: Recommendation System, Sustainable Development, Artificial Intelligence, Collaborative Filtering, Content-Based, Cosine Similarity, Movies Recommendation, NLP, Machine Learning Application.

With the rapid growth of the Internet and the consequent surge in data, the current era is characterized by information overload. As the domain of data processing and storage expands, recommendation systems have become pivotal tools in navigating this deluge, assisting users in filtering through vast information landscapes. A notable segment of this is movie recommendation systems. As living standards rise, so does the demand for cinematic experiences. Enhancing and refining the methodologies of these recommendation systems is, therefore, of significant value. However, a consistent challenge is the cold start problem encountered when new users join. Without prior viewing records or preferences, these users pose a dilemma for the system: how to offer relevant recommendations without historical data? Addressing this challenge, this paper proposes a unique method grounded in the N-armed bandit model, introducing an enhanced Epsilon-greedy algorithm specifically designed for movie recommendations for such users. By adjusting dynamically based on real-time user feedback, the algorithm aims to continuously hone its recommendation quality, ensuring a consistently better user experience.

Error characteristics of model output statistics (MOS) temperature forecasts are calculated for over 200 locations around the continental United States. The forecasts are verified on a station-by-station basis for the year 2001. Error measures used include mean algebraic error (bias), mean absolute error (MAE), relative frequency of occurrence of bias and MAE values, and the daily forecast errors themselves. A case study examining the spatial and temporal evolution of MOS errors is also presented. The error characteristics presented here, together with the case study, provide a more detailed evaluation of MOS performance than may be obtained from regionally averaged error statistics. Knowledge concerning locations where MOS forecasts have large errors or biases and why those errors or biases exist is of great value to operational forecasters. Not only does such knowledge help improve their forecasts, but forecaster performance is often compared to MOS predictions. Examples of biases in MOS forecast errors are illustrated by examining two stations in detail. Significant warm and cold biases are found in maximum temperature forecasts for Los Angeles, California (LAX), and minimum temperature forecasts for Las Vegas, Nevada (LAS), respectively. MAE values for MOS temperature predictions calculated in this study suggest that coastal stations tend to have lower MAE values and lower variability in their errors, while forecasts with high MAE and error variability are more frequent in the interior of the United States. Therefore, MAE values from samples of MOS forecasts are directly proportional to the variance in the observations. Additionally, it is found that daily maximum temperature forecast errors exhibit less variability during the summer months than they do over the rest of the year, and that forecasts for any one station rarely follow a consistent temporal pattern for more than two or three consecutive days. These inconsistent error patterns indicate that forecasting temperatures based on recent trends in MOS forecast errors at an individual station is usually not a good strategy. As shown in earlier studies by other authors and demonstrated again here, MOS temperature forecasts are often inaccurate in the vicinity of strong temperature gradients, for locations affected by shallow cold air masses, or for stations in regions of anomalously warm or cold temperatures. Finally, a case study is presented examining the spatial and temporal distributions of MOS temperature forecast errors across the United States from 13 to 15 February 2001. During this period, two surges of cold arctic air moved south into the United States. In contrast to error trends at individual stations, nationwide spatial and temporal patterns of MOS forecast errors could prove to be a powerful forecasting tool. Nationwide plots of errors in MOS forecasts would be useful if made available in real time to operational forecasters.