• Title/Summary/Keyword: Movie Performance

Search Result 227, Processing Time 0.031 seconds

Distributed Recommendation System Using Clustering-based Collaborative Filtering Algorithm (클러스터링 기반 협업 필터링 알고리즘을 사용한 분산 추천 시스템)

  • Jo, Hyun-Je;Rhee, Phill-Kyu
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.101-107
    • /
    • 2014
  • This paper presents an efficient distributed recommendation system using clustering collaborative filtering algorithm in distributed computing environments. The system was built based on Hadoop distributed computing platform, where distributed Min-hash clustering algorithm is combined with user based collaborative filtering algorithm to optimize recommendation performance. Experiments using Movie Lens benchmark data show that the proposed system can reduce the execution time for recommendation compare to sequential system.

A Simple and Effective Combination of User-Based and Item-Based Recommendation Methods

  • Oh, Se-Chang;Choi, Min
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.127-136
    • /
    • 2019
  • User-based and item-based approaches have been developed as the solutions of the movie recommendation problem. However, the user-based approach is faced with the problem of sparsity, and the item-based approach is faced with the problem of not reflecting users' preferences. 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 combining method that simplifies the combination equation of prior study. This method is relatively free from the problem of sparsity, since it has less parameters to be calculated. Thus, it can get more accurate results by reflecting the users rating to calculate the parameters. It is very fast to predict new movie ratings as well. In experiments for the proposed method, the initial error is large, but the performance gets quickly stabilized after. In addition, it showed about 6% lower average error rate than the existing method using similarity.

Bipartite Preference aware Robust Recommendation System (이분법 선호도를 고려한 강건한 추천 시스템)

  • Lee, Jaehoon;Oh, Hayoung;Kim, Chong-kwon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.4
    • /
    • pp.953-960
    • /
    • 2016
  • Due to the prevalent use of online systems and the increasing amount of accessible information, the influence of recommender systems is growing bigger than ever. However, there are several attempts by malicious users who try to compromise or manipulate the reliability of recommender systems with cyber-attacks. By analyzing the ratio of 'sympathy' against 'apathy' responses about a concerned review and reflecting the results in a recommendation system, we could present a way to improve the performance of a recommender system and maintain a robust system. After collecting and applying actual movie review data, we found that our proposed recommender system showed an improved performance compared to the existing recommendation systems.

Recommendation using Context Awareness based Information Filtering in Smart Home (스마트 홈에서 상황인식 기반의 정보 필터링을 이용한 추천)

  • Chung, Kyung-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.7
    • /
    • pp.17-25
    • /
    • 2008
  • The smart home environment focuses on recognizing the context and physical entities. And this is mainly focused on the personalized service supplied conversational interactions. In this paper, we proposed the recommendation using the context awareness based information filtering that dynamically applied by the context awareness as well as the meta data in the smart home. The proposed method defined the context information and recommended the profited service for the user’s taste using the context awareness based information filtering. Accordingly, the satisfaction of users and the quality of services will be improved the efficient recommendation by supporting the distributed processing as well as the mobility of services. Finally, to evaluate the performance of the proposed method, this study applies to MovieLens dataset in the OSGi framework, and it is compared with the performance of previous studies.

Personalized Item Recommendation using Image-based Filtering (이미지 기반 필터링을 이용한 개인화 아이템 추천)

  • Chung, Kyung-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.3
    • /
    • pp.1-7
    • /
    • 2008
  • Due to the development of ubiquitous computing, a wide variety of information is being produced and distributed rapidly in digital form. In this excess of information, it is not easy for users to search and find their desired information in short time. In this paper, we propose the personalized item recommendation using the image based filtering. This research uses the image based filtering which is extracting the feature from the image data that a user is interested in, in order to improve the superficial problem of content analysis. We evaluate the performance of the proposed method and it is compared with the performance of previous studies of the content based filtering and the collaborative filtering in the MovieLens dataset. And the results have shown that the proposed method significantly outperforms the previous methods.

Discovery of Preference through Learning Profile for Content-based Filtering (내용 기반 필터링을 위한 프로파일 학습에 의한 선호도 발견)

  • Chung, Kyung-Yong;Jo, Sun-Moon
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.2
    • /
    • pp.1-8
    • /
    • 2008
  • The information system in which users can utilize to control and to get the filtered information efficiently has appeared. Content-based filtering can reflect content information, and it provides recommendation by comparing the feature information about item and the profile of preference. This has the shortcoming of the varying accuracy of prediction depending on teaming method. This paper suggests the discovery of preference through learning the profile for the content-based filtering. This study improves the accuracy of recommendation through learning the profile according to granting the preference of 6 levels to estimated value in order to solve the problem. Finally, to evaluate the performance of the proposed method, this study applies to MovieLens dataset, and it is compared with the performance of previous studies.

Improvement of Collaborative Filtering Algorithm Using Imputation Methods

  • Jeong, Hyeong-Chul;Kwak, Min-Jung;Noh, Hyun-Ju
    • Journal of the Korean Data and Information Science Society
    • /
    • v.14 no.3
    • /
    • pp.441-450
    • /
    • 2003
  • Collaborative filtering is one of the most widely used methodologies for recommendation system. Collaborative filtering is based on a data matrix of each customer's preferences and frequently, there exits missing data problem. We introduced two imputation approach (multiple imputation via Markov Chain Monte Carlo method and multiple imputation via bootstrap method) to improve the prediction performance of collaborative filtering and evaluated the performance using EachMovie data.

  • PDF

Detecting Stress Based Social Network Interactions Using Machine Learning Techniques

  • S.Rajasekhar;K.Ishthaq Ahmed
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.8
    • /
    • pp.101-106
    • /
    • 2023
  • In this busy world actually stress is continuously grow up in research and monitoring social websites. The social interaction is a process by which people act and react in relation with each other like play, fight, dance we can find social interactions. In this we find social structure means maintain the relationships among peoples and group of peoples. Its a limit and depends on its behavior. Because relationships established on expectations of every one involve depending on social network. There is lot of difference between emotional pain and physical pain. When you feel stress on physical body we all feel with tensions, stress on physical consequences, physical effects on our health. When we work on social network websites, developments or any research related information retrieving etc. our brain is going into stress. Actually by social network interactions like watching movies, online shopping, online marketing, online business here we observe sentiment analysis of movie reviews and feedback of customers either positive/negative. In movies there we can observe peoples reaction with each other it depends on actions in film like fights, dances, dialogues, content. Here we can analysis of stress on brain different actions of movie reviews. All these movie review analysis and stress on brain can calculated by machine learning techniques. Actually in target oriented business, the persons who are working in marketing always their brain in stress condition their emotional conditions are different at different times. In this paper how does brain deal with stress management. In software industries when developers are work at home, connected with clients in online work they gone under stress. And their emotional levels and stress levels always changes regarding work communication. In this paper we represent emotional intelligence with stress based analysis using machine learning techniques in social networks. It is ability of the person to be aware on your own emotions or feeling as well as feelings or emotions of the others use this awareness to manage self and your relationships. social interactions is not only about you its about every one can interacting and their expectations too. It about maintaining performance. Performance is sociological understanding how people can interact and a key to know analysis of social interactions. It is always to maintain successful interactions and inline expectations. That is to satisfy the audience. So people careful to control all of these and maintain impression management.

Analysis on Deciles Distribution Behaviors of Four Major Korean Movie Distribution Companies and the Rest (한국 영화 4대 배급사의 흥행 10분위 기반 배급 행태 분석)

  • Kim, Jung-Ho;Kim, Jae Sung
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.6
    • /
    • pp.305-322
    • /
    • 2016
  • With the multiplex and wide release strategy, the monopolies of four major distribution companies and three multiplex chain, the polarization of Korean movie's Box Office performance is deepening. The four major distributor of NEW, CJ CGV, Lotte Cinema distributed 290 movies of 538 movies produced from 2009 to 2014 in Korea. The audience market share of these four distributors is 85.74%, while other 248 movies covers only 14.26%, which are distributed by outsides of the four major distribution system. The concentration of film admission has been deepened in Gini Index from 0.53 in 2004 to 0.85 in 2014. The movies distributed by others rather than four major companies suffers inequality in numbers of secured screens, screening times, and secured seats of movie theaters. In the highest 10% of box-office ranking, there is only one movie distributed by others. The lowest 50% of box-office ranking, there are 186 movies by others, while four companies have 81 movies. However, Occupancy rate of seat of major companies is lower than 16.83% of that of the others in the lowest 50% section. Workers of Korean movie industry are suffered from this polarization and they seek their breakthrough by producing erotic movies for VOD in recent years.

Grading System of Movie Review through the Use of An Appraisal Dictionary and Computation of Semantic Segments (감정어휘 평가사전과 의미마디 연산을 이용한 영화평 등급화 시스템)

  • Ko, Min-Su;Shin, Hyo-Pil
    • 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.

  • PDF