DCF-MLSTM: a deep security content-based filtering scheme using multiplicative BiLSTM for movie recommendation system

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.

Recommender system is the system which, by using automated information filtering technology, recommends products or services to the customers who are likely to be interested in. Those systems are widely used in many different Web retailers such as Amazon.com, Netfix.com, and CDNow.com. Various recommender systems have been developed. Among them, Collaborative Filtering (CF) has been known as the most successful and commonly used approach. CF identifies customers whose tastes are similar to those of a given customer, and recommends items those customers have liked in the past. Numerous CF algorithms have been developed to increase the performance of recommender systems. However, the relative performances of CF algorithms are known to be domain and data dependent. It is very time-consuming and expensive to implement and launce a CF recommender system, and also the system unsuited for the given domain provides customers with poor quality recommendations that make them easily annoyed. Therefore, predicting in advance whether the performance of CF recommender system is acceptable or not is practically important and needed. In this study, we propose a decision making guideline which helps decide whether CF is adoptable for a given application with certain transaction data characteristics. Several previous studies reported that sparsity, gray sheep, cold-start, coverage, and serendipity could affect the performance of CF, but the theoretical and empirical justification of such factors is lacking. Recently there are many studies paying attention to Social Network Analysis (SNA) as a method to analyze social relationships among people. SNA is a method to measure and visualize the linkage structure and status focusing on interaction among objects within communication group. CF analyzes the similarity among previous ratings or purchases of each customer, finds the relationships among the customers who have similarities, and then uses the relationships for recommendations. Thus CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. Under the assumption that SNA could facilitate an exploration of the topological properties of the network structure that are implicit in transaction data for CF recommendations, we focus on density, clustering coefficient, and centralization which are ones of the most commonly used measures to capture topological properties of the social network structure. While network density, expressed as a proportion of the maximum possible number of links, captures the density of the whole network, the clustering coefficient captures the degree to which the overall network contains localized pockets of dense connectivity. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. We explore how these SNA measures affect the performance of CF performance and how they interact to each other. Our experiments used sales transaction data from H department store, one of the well?known department stores in Korea. Total 396 data set were sampled to construct various types of social networks. The dependant variable measuring process consists of three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used UCINET 6.0 for SNA. The experiments conducted the 3-way ANOVA which employs three SNA measures as dependant variables, and the recommendation accuracy measured by F1-measure as an independent variable. The experiments report that 1) each of three SNA measures affects the recommendation accuracy, 2) the density's effect to the performance overrides those of clustering coefficient and centralization (i.e., CF adoption is not a good decision if the density is low), and 3) however though the density is low, the performance of CF is comparatively good when the clustering coefficient is low. We expect that these experiment results help firms decide whether CF recommender system is adoptable for their business domain with certain transaction data characteristics.

Recommender system is a tool to suggest items to the users from the extensive history of the user's feedback. Though, it is an emerging research area concerning academics and industries, where it suffers from sparsity, scalability, and cold start problems. This paper addresses sparsity, and scalability problems of model-based collaborative recommender system based on ensemble learning approach and enhanced clustering algorithm for movie recommendations. In this paper, an effective movie recommendation system is proposed by Classification and Regression Tree (CART) algorithm, enhanced Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) algorithm and truncation method. In this research paper, a new hyper parameters tuning is added in BIRCH algorithm to enhance the cluster formation process, where the proposed algorithm is named as enhanced BIRCH. The proposed model yields quality movie recommendation to the new user using Gradient boost classification with broad coverage. In this paper, the proposed model is tested on Movielens dataset, and the performance is evaluated by means of Mean Absolute Error (MAE), precision, recall and f-measure. The experimental results showed the superiority of proposed model in movie recommendation compared to the existing models. The proposed model obtained 0.52 and 0.57 MAE value on Movielens 100k and 1M datasets. Further, the proposed model obtained 0.83 of precision, 0.86 of recall and 0.86 of f-measure on Movielens 100k dataset, which are effective compared to the existing models in movie recommendation.

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.

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 presents a comprehensive review of movie recommendation systems and their applications in the entertainment industry. The paper highlights the different techniques used in movie recommendation systems such as collaborative filtering, content-based filtering, and hybrid filtering. The strengths and weaknesses of each technique are discussed, along with their respective algorithms. The paper also explores the challenges faced by movie recommendation systems such as data sparsity, cold start problem, and user bias. Furthermore, the paper examines the current state-of-the-art movie recommendation systems, their performance evaluation metrics, and their implementation in real world scenarios. The practical application of these systems by popular online streaming platforms is also discussed. The study concludes that movie recommendation systems are essential for enhancing user experience and engagement in the entertainment industry, and future research in this field is crucial to improving the accuracy and effectiveness of these systems. Key Words: Recommendation System, PyCharm, Jupiter Notebook, Artificial Intelligence & Machine Learning.

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.

The cold-start problem faced by recommender systems is a serious problem, mainly because of the lack of historical data for new users or items. Traditional recommendation techniques, such as collaborative filtering and content-based filtering, are prone to fail in making good recommendations under such conditions. This paper explores the use of reinforcement learning (RL) as a remedy for cold-start problems based on active learning methods and multi-armed bandit models. We propose a novel RL-based approach that learns user preferences incrementally from interaction and improves recommendations in an exploration-exploitation setting. The setting shows improved performance in personalization and user engagement compared to baseline methods. This paper also provides the first-order implications of the cold-start problem in the real world and assesses the challenges faced by industries impacted by this problem. Keywords - Recommender systems, cold-start problem, reinforcement learning, Markov decision processes, deep reinforcement learning, user modelling

In an age where digital connectivity is increasingly shaping entertainment content, personalized movie recommendations play a pivotal role in enhancing user satisfaction and engagement. This research introduces an innovative approach utilizing Enhanced Self-Organizing Maps (SOM) to streamline movie selection processes. Self-Organizing Maps (SOMs), a type of unsupervised neural network architecture, are particularly adept at discerning intricate data patterns, making them valuable assets in recommendation systems. The methodology outlined in this paper commences with gathering user-movie interaction data, including user feedback and movie characteristics, which is standardized to ensure consistency before model training. Leveraging its adaptable learning rate and neighborhood function, the Enhanced SOM effectively identifies subtle data nuances. Personalized movie suggestions are then generated by exploiting the Enhanced SOM's capacity to identify similar users and films. Integration of hybrid filtering techniques enriches recommendation quality, blending collaborative filtering algorithms, which leverage user-item interactions, with content-based filtering, which utilizes movie attributes such as genres and descriptions. This amalgamation results in suggestions that harmoniously combine diverse filtering methodologies. The proposed solution's efficacy is rigorously evaluated by comparing suggestion accuracy and user satisfaction against predefined benchmarks. Extensive real-world dataset testing corroborates the effectiveness of the Enhanced SOM-based movie recommendation approach. Furthermore, the system offers flexibility through options for parameter adjustment, grid size variations, and neighborhood function modifications to further refine recommendation accuracy. Collectively, these elements underscore the efficacy of the proposed method in furnishing tailored movie recommendations. When coupled with hybrid filtering techniques, the implementation of Enhanced SOMs emerges as a reliable model for content platforms seeking to enhance user experiences by delivering precise movie recommendations, coupled with scalability and adaptability.

The general personality traits, notably the Big-Five personality traits, have been increasingly integrated into recommendation systems. The personality-aware recommendations, which incorporate human personality into recommendation systems, have shown promising results in general recommendation areas including music, movie, and e-commerce recommendations. On the other hand, the number of research delving into the applicability of personality-aware recommendations in specialized domains such as finance and education remains limited. In addition, these domains have unique challenges in incorporating personality-aware recommendations as domain-specific psychological traits such as risk tolerance and behavioral biases play a crucial role in explaining user behavior in these domains. Addressing these challenges, this study addresses an in-depth exploration of personality-aware recommendations in the financial domain, specifically within the context of stock recommendations. First, this study investigates the benefits of deploying general personality traits in stock recommendations through the integration of personality-aware recommendations with user-based collaborative filtering approaches. Second, this study further verifies whether incorporating domain-specific psychological traits along with general personality traits enhances the performance of stock recommender systems. Thirdly, this paper introduces a personalized stock recommendation model that incorporates both general personality traits and domain-specific psychological traits as well as transaction data. The experimental results show that the proposed model outperformed baseline models in financial stock recommendations.

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.

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

Video recordings are complex media types. When we watch a movie, we can effortlessly register a lot of details conveyed to us (by the author) through different multimedia channels, in particular, the audio and visual modalities. To date, majority of movie recommender systems use collaborative filtering (CF) models or content-based filtering (CBF) relying on metadata (e.g., editorial such as genre or wisdom of the crowd such as user-generated tags) at their core since they are human-generated and are assumed to cover the ‘content semantics’ of movies by a great degree. The information obtained from multimedia content and learning from muli-modal sources (e.g., audio, visual and metadata) on the other hand, offers the possibility of uncovering relationships between modalities and obtaining an in-depth understanding of natural phenomena occurring in a video. These discerning characteristics of heterogeneous feature sets meet users’ differing information needs. In the context of this Ph.D. thesis [9], which is briefly summarized in the current extended abstract, approaches to automated extraction of multimedia information from videos and their integration with video recommender systems have been elaborated, implemented, and analyzed. Variety of tasks related to movie recommendation using multimedia content have been studied. The results of this thesis can motivate the fact that recommender system research can benefit from knowledge in multimedia signal processing and machine learning established over the last decades for solving various recommendation tasks.

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.