• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4684-4705
• /
• 2019

Collaborative filtering recommender systems are vulnerable to shilling attacks in which malicious users may inject biased profiles to promote or demote a particular item being recommended. To tackle this problem, many robust collaborative recommendation methods have been presented. Unfortunately, the robustness of most methods is improved at the expense of prediction accuracy. In this paper, we construct a robust Bayesian probabilistic matrix factorization model for collaborative filtering recommender systems by incorporating the detection of user anomaly rating behaviors. We first detect the anomaly rating behaviors of users by the modified K-means algorithm and target item identification method to generate an indicator matrix of attack users. Then we incorporate the indicator matrix of attack users to construct a robust Bayesian probabilistic matrix factorization model and based on which a robust collaborative recommendation algorithm is devised. The experimental results on the MovieLens and Netflix datasets show that our model can significantly improve the robustness and recommendation accuracy compared with three baseline methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2602-2608
• /
• 2013

User-based and item-based method have been developed as the solutions of the movie recommendation problem. However, these methods are faced with the sparsity problem and the problem of not reflecting user's rating respectively. In order to solve these problems, there is a research on the combination of the two methods using the concept of similarity. In reality, it is not free from the problem of sparsity, since it has a lot of parameters to be calculated. In this study, we propose a recommendation method using rating difference between items in order to complement this problem. This method is relatively free from the problem of sparsity, since it has less parameters to be calculated. And it can get more accurate results by reflecting the users rating to calculate the parameters. In experiments for the proposed method, the initial error is large, but the performance has been quickly stabilized after. In addition, it showed a 0.0538 lower average error compared to the existing method using similarity.

• Journal of Intelligence and Information Systems
• /
• v.19 no.3
• /
• pp.25-44
• /
• 2013

Accessing movie contents has become easier and increased with the advent of smart TV, IPTV and web services that are able to be used to search and watch movies. In this situation, there are increasing search for preference movie contents of users. However, since the amount of provided movie contents is too large, the user needs more effort and time for searching the movie contents. Hence, there are a lot of researches for recommendations of personalized item through analysis and clustering of the user preferences and user profiles. In this study, we propose recommendation system which uses ontology based knowledge base. Our ontology can represent not only relations between metadata of movies but also relations between metadata and profile of user. The relation of each metadata can show similarity between movies. In order to build, the knowledge base our ontology model is considered two aspects which are the movie metadata model and the user model. On the part of build the movie metadata model based on ontology, we decide main metadata that are genre, actor/actress, keywords and synopsis. Those affect that users choose the interested movie. And there are demographic information of user and relation between user and movie metadata in user model. In our model, movie ontology model consists of seven concepts (Movie, Genre, Keywords, Synopsis Keywords, Character, and Person), eight attributes (title, rating, limit, description, character name, character description, person job, person name) and ten relations between concepts. For our knowledge base, we input individual data of 14,374 movies for each concept in contents ontology model. This movie metadata knowledge base is used to search the movie that is related to interesting metadata of user. And it can search the similar movie through relations between concepts. We also propose the architecture for movie recommendation. The proposed architecture consists of four components. The first component search candidate movies based the demographic information of the user. In this component, we decide the group of users according to demographic information to recommend the movie for each group and define the rule to decide the group of users. We generate the query that be used to search the candidate movie for recommendation in this component. The second component search candidate movies based user preference. When users choose the movie, users consider metadata such as genre, actor/actress, synopsis, keywords. Users input their preference and then in this component, system search the movie based on users preferences. The proposed system can search the similar movie through relation between concepts, unlike existing movie recommendation systems. Each metadata of recommended candidate movies have weight that will be used for deciding recommendation order. The third component the merges results of first component and second component. In this step, we calculate the weight of movies using the weight value of metadata for each movie. Then we sort movies order by the weight value. The fourth component analyzes result of third component, and then it decides level of the contribution of metadata. And we apply contribution weight to metadata. Finally, we use the result of this step as recommendation for users. We test the usability of the proposed scheme by using web application. We implement that web application for experimental process by using JSP, Java Script and prot$\acute{e}$g$\acute{e}$ API. In our experiment, we collect results of 20 men and woman, ranging in age from 20 to 29. And we use 7,418 movies with rating that is not fewer than 7.0. In order to experiment, we provide Top-5, Top-10 and Top-20 recommended movies to user, and then users choose interested movies. The result of experiment is that average number of to choose interested movie are 2.1 in Top-5, 3.35 in Top-10, 6.35 in Top-20. It is better than results that are yielded by for each metadata.

• Knowledge Management Research
• /
• v.18 no.2
• /
• pp.65-83
• /
• 2017

Word-of-mouth (WOM), the communication between consumers offline, has transformed to include electronic word-of-mouth(eWOM), which has grown in its influence due to the advancements in communication technology. Despite the fact that many researchers have studied the impact of WOM and eWOM on the performance of movies in the movie industry, there still exists much controversy. Therefore, this study investigates the relationship of eWOM's volume and valence with the box office revenue for 2 years in Korean movies industry. The results show that the volume of eWOM, which is expected to related to awareness diffusion, is more important than the valence in the early stage of movie release. And in the later stage, the valence of eWOM which is expected to related to persuasion effect influences the box office revenue. In addition, the relationship of the volume and valence on box office revenue in both early and later stage can be increased through the interaction with the star power which raises the familiarity or the movie genre which causes the high arousal.

• Communications for Statistical Applications and Methods
• /
• v.18 no.6
• /
• pp.859-869
• /
• 2011

Interest has increased in academic research regarding key factors that drive box-office success as well as the ability to predict the box-office success of a movie from a commercial perspective. This study analyzed the relationship between key success factors of a movie and box office records based on movies released in 2010 in Korea. At the pre-production investment decision-making stage, the movie genre, motion picture rating, director power, and actor power were statistically significant. At the stage of distribution decision-making process after movie production, among other factors, the influence of star actors, number of screens, power of distributors, and social media turned out to be statistically significant. We verified movie success factors through the application of a Multinomial Logit Model that used the concept of choice probabilities. The Multinomial Logit Model resulted in a higher level of accuracy in predicting box-office success compared to the Artificial Neural Network and Discriminant Analysis.

• Management Science and Financial Engineering
• /
• v.11 no.3
• /
• pp.137-153
• /
• 2005

Collaborative filtering-based recommendation systems make personalized recommendations based on users' ratings on products. Recommender systems must collect sufficient rating information from users to provide relevant recommendations because less user rating information results in poorer performance of recommender systems. To learn about new users, recommendation systems must first present users with an initial item list. In this study, we designed and analyzed seven selection strategies including the popularity, favorite, clustering, genre, and entropy methods. We investigated how these strategies performed using MovieLens, a public dataset. While the favorite and popularity methods tended to produce the highest average score and greatest average number of ratings, respectively, a hybrid of both favorite and popularity methods or a hybrid of demographic, favorite, and popularity methods also performed within acceptable ranges for both rating scores and numbers of ratings.

• Korean Journal of Cognitive Science
• /
• v.21 no.4
• /
• pp.669-696
• /
• 2010

Assuming that the whole meaning of a document is a composition of the meanings of each part, this paper proposes to study the automatic grading of movie reviews which contain sentimental expressions. This will be accomplished by calculating the values of semantic segments and performing data classification for each review. The ARSSA(The Automatic Rating System for Sentiment analysis using an Appraisal dictionary) system is an effort to model decision making processes in a manner similar to that of the human mind. This aims to resolve the discontinuity between the numerical ranking and textual rationalization present in the binary structure of the current review rating system: {rate: review}. This model can be realized by performing analysis on the abstract menas extracted from each review. The performance of this system was experimentally calculated by performing a 10-fold Cross-Validation test of 1000 reviews obtained from the Naver Movie site. The system achieved an 85% F1 Score when compared to predefined values using a predefined appraisal dictionary.

• Science of Emotion and Sensibility
• /
• v.17 no.1
• /
• pp.71-78
• /
• 2014

We propose the sentiment pattern as a novel sentiment feature for more accurate text sentiment analysis, and introduce the rating inference of movie reviews using it. The text sentiment analysis is a task that recognizes and classifies sentiment of text whether it is positive or negative. For that purpose, the sentiment feature is used, which includes sentiment words and phrase pattern that have specific sentiment like positive or negative. The previous researches for the sentiment analysis, however, have a limit to understand accurately total sentiment of either a sentence or text because they consider the sentiment of sentiment words and phrase patterns independently. Therefore, we propose the sentiment pattern that is defined by arranging semantically all sentiment in a sentence, and use them as a new sentiment feature for the rating inference that is one of the detail subjects of the sentiment analysis. In order to verify the effect of proposed sentiment pattern, we conducted experiments of rating inference. Ratings of test reviews is inferred by using a probabilistic method with sentiment features including sentiment patterns extracted from training reviews. As a result, it is shown that the result of rating inference with sentiment patterns are more accurate than that without sentiment patterns.

• The Korean Journal of Applied Statistics
• /
• v.29 no.7
• /
• pp.1257-1270
• /
• 2016

This study deals with the prediction of the total number of movie audiences as a measure for the box office. Prediction is performed by classification techniques of data mining such as decision tree, multilayer perceptron(MLP) neural network model, multinomial logit model, and support vector machine over time such as before movie release, release day, after release one week, and after release two weeks. Predictors used are: online word-of-mouth(OWOM) variables such as the portal movie rating, the number of the portal movie rater, and blog; in addition, other variables include showing the inherent properties of the film (such as nationality, grade, release month, release season, directors, actors, distributors, the number of audiences, and screens). When using 10-fold cross validation technique, the accuracy of the neural network model showed more than 90 % higher predictability before movie release. In addition, it can be seen that the accuracy of the prediction increases by adding estimates of the final OWOM variables as predictors.

• The Korean Journal of Applied Statistics
• /
• v.33 no.6
• /
• pp.833-842
• /
• 2020

Global platforms such as Netflix, Amazon, and YouTube have developed a precise recommendation system based on various information from large set of customers and many of the items recommended here are leading to actual purchases. In this paper, a cluster analysis was conducted according to the attribute of the content, expecting that there would be a difference in user preferences according to the attribute of the recommended content. Gower distance was used for use regardless of the type of variables. In this paper, using the data of movie rating site 'The Movie Dataset', the users were grouped hierarchically and recommended movies based on genre, director and actor variables. To evaluate the recommended systems proposed, user group was divided into train set and test set to examine the precision. The results showed that proposed algorithms have far higher precision than UBCF.