• Title/Summary/Keyword: 영화 추천

Search Result 161, Processing Time 0.037 seconds

An Efficient Collaborative Filtering Method Based on k-Nearest Neighbor Learning for Large-Scale Data (대규모 데이터를 위한 k-최근접 이웃 학습 기반의 효율적인 협력적 여과 기법)

  • Jun, Kwang-Sung;Hwang, Kyu-Baek
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06c
    • /
    • pp.376-380
    • /
    • 2008
  • 사회의 복잡화와 인터넷의 성장으로 폭발적으로 늘어나고 있는 정보들을 사용자가 모두 검토한 후 여과하기는 어려운 일이다. 이러한 문제를 보완하기 위해서 자동화된 정보 여과 기술이 사용되는데, k-최근접 이웃(k-nearest neighbor) 알고리즘은 그 구현이 간단하며 비교적 정확하여 가장 널리 쓰이고 있는 알고리즘 중 하나이다. k 개의 최근접 이웃들로부터 평가값을 계산하는 데 흔히 쓰이는 방법은 상관계수를 이용한 가중치에 기반하는 것이다. 본 논문에서는 이를 보완하여 대규모 데이터에 대해서도 속도는 크게 저하되지 않으며 정확도는 대폭 향상시킬 수 있는 방법을 적용하였다. 또한, 최근접 이웃을 구하는 거리함수로 다양한 방법을 시도하였다. 영화추천을 위한 실제 데이터에 대한 실험 결과, 속도의 저하는 미미하였으나 정확도에 있어서는 크게 향상된 결과를 가져올 수 있었다.

  • PDF

Fast Computation of All-pairs 2-step Radom Walk on Large Graphs (큰 그래프에서의 모든 쌍에 대한 빠른 2 단계 랜덤 워크 계산 방법)

  • Park, Sung-Chan;Lee, Sang-Goo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06c
    • /
    • pp.125-127
    • /
    • 2012
  • 현재 이종 그래프에 대한 연구가 활발히 진행되고 있다. 특히 추천 및 검색 분야에서 이종 그래프를 활용하여 성능을 높이는 성과가 두드러진다. 이종 그래프는 다양한 정보를 갖고 있으며, 특히 2단계 랜덤 워크 확률은 여러 유용한 정보를 가지고 있다. "어떤 사용자가 많이 본 영화를 많이 본 사용자", "어떤 사용자의 이웃이 많이 구입한 상품" 등이 그예이다. 하지만 이러한 정보를 실시간에 계산하기는 어려우며, 미리 계산해두는 것도 시간이 많이 든다. 이에 따라, 본 연구에서는 모든 출발 노드-도착 노드 쌍에 대한 2단계 랜덤 워크를 빠르게 미리 계산하는 알고리듬을 제시한다. 동일한 이웃 노드를 다수 가진 두 노드에서 출발하는 랜덤 워크 확률 값은 서로 비슷하다는 사실을 이용하여, 이전 계산 결과를 활용하여 근접 노드 목록에 대한 임의 접근 횟수를 줄인다. 더불어 본 알고리듬과 관련된 현안을 몇 가지 소개한다.

Automatic Video Editing Application based on Climax Pattern Classified by Genre (장르별 클라이맥스 패턴 적용 자동 영상편집 어플리케이션)

  • Im, Hyejeong;Mun, Hyejun;Park, Gaeun;Lim, Yangmi
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.07a
    • /
    • pp.611-612
    • /
    • 2020
  • 최근 유튜브, 네이버와 같은 플랫폼 사업자들은 다양하고 많은 동영상확보를 위해 최대한 시간을 적게 들이고 좋은 퀄리티의 영상을 자동으로 생성해주는 어플리케이션을 개발하는데 AI 기술을 적극적으로 사용하고 있다. 가장 주도적으로 진행하는 곳은 IBM 의 왓슨의 인지하이라이트 기술이다. 관중의 함성소리와 스포츠특성 데이터들을 활용하여 하이라이트 부분의 영상만 자동 생성하고 있다. 하지만 현재까지의 기술은 인간의 감성을 자극하는 스토리 전개방식의 자동영상 생성에 있어서는 부족한 부분이 많이 존재한다.이 에 본 논문은 영화의 클라이맥스 부분의 영상편집방식을 분석하여 이에 대한 장르별 샷 사이즈 변화패턴을 시각화한 후, 장르간 편집 차이점을 패턴화한 템플릿을 구축하여 사용자의 이미지 데이터들을 장르별 클라이맥스 패턴의 특성에 맞게 추천하여 짧은 영상을 자동 생성하는 어플리케이션을 개발하였다. 향후 본 연구는 1 인 미디어 산업 및 사이버교육 분야에서 가장 많이 소요되는 영상편집 시간을 단축하는데 큰 효율이 있을 것이라 기대한다.

  • PDF

Content-based Movie Recommendation system based on demographic information and average ratings of genres. (사용자 정보 및 장르별 평균 평가를 이용한 내용 기반 영화 추천 시스템)

  • Ugli, Sadriddinov Ilkhomjon Rovshan;Park, Doo-Soon;Kim, Dae-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.11a
    • /
    • pp.34-36
    • /
    • 2022
  • Over the last decades, information has increased exponentially due to SNS(Social Network Service), IoT devices, World Wide Web, and many others. Therefore, it was monumentally hard to offer a good service or set of recommendations to consumers. To surmount this obstacle numerous research has been conducted in the Data Mining field. Different and new recommendation models have emerged. In this paper, we proposed a Content-based movie recommendation system using demographic information of users and the average rating for genres. We used MovieLens Dataset to proceed with our experiment.

A Movie recommendation using method of Spectral Bipartition on Implicit Social Network (잠재적 소셜 네트워크를 이용하여 스펙트럼 분할하는 방식 기반 영화 추천 시스템)

  • Sadriddinov Ilkhomjon;Sony Peng;Sophort Siet;Dae-Young Kim;Doo-Soon Park
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.322-326
    • /
    • 2023
  • We propose a method of movie recommendation that involves an algorithm known as spectral bipartition. The Social Network is constructed manually by considering the similar movies viewed by users in MovieLens dataset. This kind of similarity establishes implicit ties between viewers. Because we assume that there is a possibility that there might be a connection between users who share the same set of viewed movies. We cluster users by applying a community detection algorithm based on the spectral bipartition. This study helps to uncover the hidden relationships between users and recommend movies by considering that feature.

Efficient Multicasting Mechanism for Mobile Computing Environment (교육 영상제작 시스템 설계 및 구현)

  • Kim, Jungguk;Cho, Wijae;Park, Subeen;Park, Suhyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.482-484
    • /
    • 2017
  • Over the past 70 years, movies and television have revolutionized the way people communicate. However, even with this development, TV has been used only as a means of communication targeting an unspecified number of people due to the restriction of media such as radio waves and movies. However, the development of the Internet and online video has come to a time when 100 million people watch YouTube videos uploaded from the other side of the world by eliminating these restrictions. The message that you want to deliver now can be delivered to anyone, but making the image with these messages remains the last obstacle to communication. To solve these problems, we implemented a web application and a video production program through AWS. This system basically provides the administrator with the video production through the easy interface, the information management and the program on the server on the internet through AWS, the assigned lecture including the computer and the smart phone, the learning materials, And implemented to increase the efficiency of educational video production service.

  • PDF

Method of Automatically Generating Metadata through Audio Analysis of Video Content (영상 콘텐츠의 오디오 분석을 통한 메타데이터 자동 생성 방법)

  • Sung-Jung Young;Hyo-Gyeong Park;Yeon-Hwi You;Il-Young Moon
    • Journal of Advanced Navigation Technology
    • /
    • v.25 no.6
    • /
    • pp.557-561
    • /
    • 2021
  • A meatadata has become an essential element in order to recommend video content to users. However, it is passively generated by video content providers. In the paper, a method for automatically generating metadata was studied in the existing manual metadata input method. In addition to the method of extracting emotion tags in the previous study, a study was conducted on a method for automatically generating metadata for genre and country of production through movie audio. The genre was extracted from the audio spectrogram using the ResNet34 artificial neural network model, a transfer learning model, and the language of the speaker in the movie was detected through speech recognition. Through this, it was possible to confirm the possibility of automatically generating metadata through artificial intelligence.

A study on the Prediction Performance of the Correspondence Mean Algorithm in Collaborative Filtering Recommendation (협업 필터링 추천에서 대응평균 알고리즘의 예측 성능에 관한 연구)

  • Lee, Seok-Jun;Lee, Hee-Choon
    • Information Systems Review
    • /
    • v.9 no.1
    • /
    • pp.85-103
    • /
    • 2007
  • The purpose of this study is to evaluate the performance of collaborative filtering recommender algorithms for better prediction accuracy of the customer's preference. The accuracy of customer's preference prediction is compared through the MAE of neighborhood based collaborative filtering algorithm and correspondence mean algorithm. It is analyzed by using MovieLens 1 Million dataset in order to experiment with the prediction accuracy of the algorithms. For similarity, weight used in both algorithms, commonly, Pearson's correlation coefficient and vector similarity which are used generally were utilized, and as a result of analysis, we show that the accuracy of the customer's preference prediction of correspondence mean algorithm is superior. Pearson's correlation coefficient and vector similarity used in two algorithms are calculated using the preference rating of two customers' co-rated movies, and it shows that similarity weight is overestimated, where the number of co-rated movies is small. Therefore, it is intended to increase the accuracy of customer's preference prediction through expanding the number of the existing co-rated movies.

Examining Factors Affecting the Binge-Watching Behaviors of OTT Services (OTT(Over-the-Top) 서비스의 몰아보기 시청행위 영향 요인 탐색)

  • Hwang, Kyung-Ho;Kim, Kyung-Ae
    • Journal of the Korea Convergence Society
    • /
    • v.11 no.3
    • /
    • pp.181-186
    • /
    • 2020
  • The purpose of this study is to empirically examine the factors affecting the binge-watching behaviors of OTT service users by using a multi-layer perceptron (MLP) artificial neural network. All samples (n=1,000) were collected from 'A survey on user awareness in OTT service' published by a Media Research Center of the Korea Press Foundation in 2018. Our research model includes one dependent variable which is binge-watching behaviors on OTT service and five independent variables such as gender, age, frequency of service usage, users' satisfaction with content recommendation algorithm, and content types mainly consumed. Our findings demonstrate that age, frequency of service usage, users' satisfaction with content recommendation algorithms, and certain types of contents (e.g., Korean dramas, Korean films, and foreign dramas) were found to be highly related to binge-watching behavior on OTT services.

How to improve the accuracy of recommendation systems: Combining ratings and review texts sentiment scores (평점과 리뷰 텍스트 감성분석을 결합한 추천시스템 향상 방안 연구)

  • Hyun, Jiyeon;Ryu, Sangyi;Lee, Sang-Yong Tom
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.1
    • /
    • pp.219-239
    • /
    • 2019
  • As the importance of providing customized services to individuals becomes important, researches on personalized recommendation systems are constantly being carried out. Collaborative filtering is one of the most popular systems in academia and industry. However, there exists limitation in a sense that recommendations were mostly based on quantitative information such as users' ratings, which made the accuracy be lowered. To solve these problems, many studies have been actively attempted to improve the performance of the recommendation system by using other information besides the quantitative information. Good examples are the usages of the sentiment analysis on customer review text data. Nevertheless, the existing research has not directly combined the results of the sentiment analysis and quantitative rating scores in the recommendation system. Therefore, this study aims to reflect the sentiments shown in the reviews into the rating scores. In other words, we propose a new algorithm that can directly convert the user 's own review into the empirically quantitative information and reflect it directly to the recommendation system. To do this, we needed to quantify users' reviews, which were originally qualitative information. In this study, sentiment score was calculated through sentiment analysis technique of text mining. The data was targeted for movie review. Based on the data, a domain specific sentiment dictionary is constructed for the movie reviews. Regression analysis was used as a method to construct sentiment dictionary. Each positive / negative dictionary was constructed using Lasso regression, Ridge regression, and ElasticNet methods. Based on this constructed sentiment dictionary, the accuracy was verified through confusion matrix. The accuracy of the Lasso based dictionary was 70%, the accuracy of the Ridge based dictionary was 79%, and that of the ElasticNet (${\alpha}=0.3$) was 83%. Therefore, in this study, the sentiment score of the review is calculated based on the dictionary of the ElasticNet method. It was combined with a rating to create a new rating. In this paper, we show that the collaborative filtering that reflects sentiment scores of user review is superior to the traditional method that only considers the existing rating. In order to show that the proposed algorithm is based on memory-based user collaboration filtering, item-based collaborative filtering and model based matrix factorization SVD, and SVD ++. Based on the above algorithm, the mean absolute error (MAE) and the root mean square error (RMSE) are calculated to evaluate the recommendation system with a score that combines sentiment scores with a system that only considers scores. When the evaluation index was MAE, it was improved by 0.059 for UBCF, 0.0862 for IBCF, 0.1012 for SVD and 0.188 for SVD ++. When the evaluation index is RMSE, UBCF is 0.0431, IBCF is 0.0882, SVD is 0.1103, and SVD ++ is 0.1756. As a result, it can be seen that the prediction performance of the evaluation point reflecting the sentiment score proposed in this paper is superior to that of the conventional evaluation method. In other words, in this paper, it is confirmed that the collaborative filtering that reflects the sentiment score of the user review shows superior accuracy as compared with the conventional type of collaborative filtering that only considers the quantitative score. We then attempted paired t-test validation to ensure that the proposed model was a better approach and concluded that the proposed model is better. In this study, to overcome limitations of previous researches that judge user's sentiment only by quantitative rating score, the review was numerically calculated and a user's opinion was more refined and considered into the recommendation system to improve the accuracy. The findings of this study have managerial implications to recommendation system developers who need to consider both quantitative information and qualitative information it is expect. The way of constructing the combined system in this paper might be directly used by the developers.