• The Korean Journal of Applied Statistics
• /
• v.35 no.2
• /
• pp.265-283
• /
• 2022

MovieLens data consists of recorded movie evaluations that was often used to measure the evaluation score in the recommendation system research field. In this paper, we provide additional information obtained by clustering user-specific genre preference information through movie evaluation data and movie genre data. Because the number of movie ratings per user is very low compared to the total number of movies, the missing rate in this data is very high. For this reason, there are limitations in applying the existing clustering methods. In this paper, we propose a convex clustering-based method using the pairwise fused penalty motivated by the analysis of MovieLens data. In particular, the proposed clustering method execute missing imputation, and at the same time uses movie evaluation and genre weights for each movie to cluster genre preference information possessed by each individual. We compute the proposed optimization using alternating direction method of multipliers algorithm. It is shown that the proposed clustering method is less sensitive to noise and outliers than the existing method through simulation and MovieLens data application.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.475-482
• /
• 2013

Several approaches to recommendation systems have been studied. One of the most successful technologies for building personalization and recommendation systems is collaborative filtering, which is a technique that provides a process of filtering customer information based on such information profiles. Collaborative filtering systems, however, have a sparsity if there is not enough data to recommend. In this paper, we suggest a movie recommendation system, based on the weighted personal propensity and the collaborating filtering system, in order to provide a solution to such sparsity. Furthermore, we assess the system's applicability by using the open database MovieLens, and present a weighted personal propensity framework for improvement in the performance of recommender systems. We successfully come up with a movie recommendation system through the optimal personalization factors.

• Journal of Information Technology Services
• /
• v.16 no.3
• /
• pp.167-183
• /
• 2017

The rapid growth of information technology and mobile service platforms, i.e., internet, google, and facebook, etc. has led the abundance of data. Due to this environment, the world is now facing a revolution in the process that data is searched, collected, stored, and shared. Abundance of data gives us several opportunities to knowledge discovery and data mining techniques. In recent years, data mining methods as a solution to discovery and extraction of available knowledge in database has been more popular in e-commerce service fields such as, in particular, movie recommendation. However, most of the classification approaches for predicting the movie popularity have used only several types of information of the movie such as actor, director, rating score, language and countries etc. In this study, we propose a classification-based support vector machine (SVM) model for predicting the movie popularity based on movie's genre data and social network data. Social network analysis (SNA) is used for improving the classification accuracy. This study builds the movies' network (one mode network) based on initial data which is a two mode network as user-to-movie network. For the proposed method we computed degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality as centrality measures in movie's network. Those four centrality values and movies' genre data were used to classify the movie popularity in this study. The logistic regression, neural network, $na{\ddot{i}}ve$ Bayes classifier, and decision tree as benchmarking models for movie popularity classification were also used for comparison with the performance of our proposed model. To assess the classifier's performance accuracy this study used MovieLens data as an open database. Our empirical results indicate that our proposed model with movie's genre and centrality data has by approximately 0% higher accuracy than other classification models with only movie's genre data. The implications of our results show that our proposed model can be used for improving movie popularity classification accuracy.

• The Journal of Bigdata
• /
• v.2 no.1
• /
• pp.41-48
• /
• 2017

Recently, the popularity of the recommendation system and the evaluation of the performance of the algorithm of the recommendation system have become important. In this study, we used modeling and RMSE to verify the effectiveness of various algorithms in movie data. The data of this study is based on user-based collaborative filtering using Pearson correlation coefficient, item-based collaborative filtering using cosine correlation coefficient, and item-based collaborative filtering model using singular value decomposition. As a result of evaluating the scores with three recommendation models, we found that item-based collaborative filtering accuracy is much higher than user-based collaborative filtering, and it is found that matrix recommendation is better when using matrix decomposition.

• KNOM Review
• /
• v.24 no.1
• /
• pp.20-28
• /
• 2021

Extensive use of social media applications and mobile devices continues to increase data traffic. Social media applications generate an endless and massive amount of multimedia traffic, specifically video traffic. Many social media platforms such as YouTube, Daily Motion, and Netflix generate endless video traffic. On these platforms, only a few popular videos are requested many times as compared to other videos. These popular videos should be cached in the user vicinity to meet continuous user demands. MEC has emerged as an essential paradigm for handling consistent user demand and caching videos in user proximity. The problem is to understand how user demand pattern varies with time. This paper analyzes three publicly available datasets, MovieLens 20M, MovieLens 100K, and The Movies Dataset, to find the user request pattern over time. We find hourly, daily, monthly, and yearly trends of all the datasets. Our resulted pattern could be used in other research while generating and analyzing the user request pattern in MEC-based video caching scenarios.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1141-1155
• /
• 2019

Today, most approaches used in the recommendation system provide correct data prediction similar to the data that users need. The method that researchers are paying attention and apply as a model in the recommendation system is the communities' detection in the big social network. The outputted result of this approach is effective in improving the exactness. Therefore, in this paper, the personalized movie recommendation system that combines data mining for the k-clique method is proposed as the best exactness data to the users. The proposed approach was compared with the existing approaches like k-clique, collaborative filtering, and collaborative filtering using k-nearest neighbor. The outputted result guarantees that the proposed method gives significant exactness data compared to the existing approach. In the experiment, the MovieLens data were used as practice and test data.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.159-168
• /
• 2011

As e-commerce and social media service evolves, studies on recommender systems advance, especially concerning the application of collective intelligence to personalized custom service. With the development of smartphones and mobile environment, studies on customized service are accelerated despite physical limitations of mobile devices. A typical example is combined with location-based services. In this study, we propose a recommender system using movie genre similarity and preferred genres. A profile of movie genre similarity is generated and designed to provide related service in mobile experimental environment before prototyping and testing with data from MovieLens.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.43-48
• /
• 2017

Movie ratings are crucial for recommendation engines that track the behavior of all users and utilize the information to suggest items the users might like. It is intuitively appealing that information about the viewing preferences in terms of movie genres is sufficient for predicting a genre of an unlabeled movie. In order to predict movie genres, we treat ratings as a feature vector, apply a Bernoulli event model to estimate the likelihood of a movie being assigned a certain genre, and evaluate the posterior probability of the genre of a given movie by using the Bayes rule. The goal of the proposed technique is to efficiently use movie ratings for the task of predicting movie genres. In our approach, we attempted to answer the question: "Given the set of users who watched a movie, is it possible to predict the genre of a movie on the basis of its ratings?" The simulation results with MovieLens 1M data demonstrated the efficiency and accuracy of the proposed technique, achieving an 83.8% prediction rate for exact prediction and 84.8% when including correlated genres.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.3
• /
• pp.67-72
• /
• 2021

Association rule mining is a method of showing the relationship between patterns hidden in several tables. These days, granulation logic is used to add more detailed meaning to association rule mining. In addition, unlike the existing system that recommends using existing data, the granulation related rules can also recommend new subscribers or new products. Therefore, determining the qualitative size of the granulation of the association rule determines the performance of the recommendation system. In this paper, we propose a granulation method for subscribers and movie data using fuzzy logic and Shannon entropy concepts in order to understand the relationship to the movie evaluated by the viewers. The research is composed of two stages: 1) Identifying the size of granulation of data, which plays a decisive role in the implications of the association rules between viewers and movies; 2) Mining the association rules between viewers and movies using these granulations. We preprocessed Netflix's MovieLens data. The results of meanings of association rules and accuracy of recommendation are suggested with managerial implications in conclusion section.

• Journal of Information Technology Applications and Management
• /
• v.30 no.4
• /
• pp.29-38
• /
• 2023

A single-learner model which integrates the user's positive and negative perceptions is proposed by augmenting counterfactual data to the interaction data between users and items, which are mainly used in collaborative filtering in this study. The proposed CausRec showed superior performance compared to the existing NCF model in terms of F1 value and AUC in experiments using three published datasets: MovieLens 100K, Amazon Gift Card, and Amazon Magazine. Compared to the existing NCF model, the F1 and AUC values of CausRec showed 1.2% and 2.6% performance improvement in MovieLens 100K data, and 2.2% and 10% improvement in Amazon Gift Card data, respectively. In particular, in experiments using Amazon Magazine data, F1 and AUC values were improved by 11.7% and 21.9%, respectively, showing a significant performance improvement effect. The performance of CausRec is improved because both positive and negative perceptions of the item were reflected in the recommendation at the same time. It is judged that the proposed method was able to improve the performance of the collaborative filtering because it can simultaneously alleviate the sparsity and imbalance problems of the interaction data.