• Title/Summary/Keyword: internet movie

Search Result 143, Processing Time 0.029 seconds

A Study on Changes in Korean Image of Foreign Tourists Using Big Data - Post COVID-19 -

  • Yoo, Kyoung-Mi;Choi, Youn-Hee;Ryu, Gi-Hwan
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.72-78
    • /
    • 2021
  • Currently, the Korean wave is not limited to popular culture, but has a significant impact not only on Korea's national image but also on the improvement of Korean companies' products and image of Korea. In this study, using Textom to confirm the change in foreign tourists' image of Korea, the data collection period was 1 year of 2020, when COVID 19 occurred, as a collection period for "Korea and foreigner" and related key words, each Hallyu content, and ranked in the top 80 keywords were derived. Centrality analysis for semantic network visualization was performed using UCINET6, and through CONCOR analysis, 7 groups 'K-Quarantine ', 'K-Drama', 'K-Movie', 'K-Beauty', 'K-Shopping', It was clustered into 'K-Tech' and 'K-Pop'. As a result of the analysis, the image of Korea abroad generally recognized the Korean Wave as cultural content, but after the outbreak of COVID 19, it is judged that it has been recognized as a country with a successful case of K-Quarantine.

A Hybrid Recommendation System based on Fuzzy C-Means Clustering and Supervised Learning

  • Duan, Li;Wang, Weiping;Han, Baijing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2399-2413
    • /
    • 2021
  • A recommendation system is an information filter tool, which uses the ratings and reviews of users to generate a personalized recommendation service for users. However, the cold-start problem of users and items is still a major research hotspot on service recommendations. To address this challenge, this paper proposes a high-efficient hybrid recommendation system based on Fuzzy C-Means (FCM) clustering and supervised learning models. The proposed recommendation method includes two aspects: on the one hand, FCM clustering technique has been applied to the item-based collaborative filtering framework to solve the cold start problem; on the other hand, the content information is integrated into the collaborative filtering. The algorithm constructs the user and item membership degree feature vector, and adopts the data representation form of the scoring matrix to the supervised learning algorithm, as well as by combining the subjective membership degree feature vector and the objective membership degree feature vector in a linear combination, the prediction accuracy is significantly improved on the public datasets with different sparsity. The efficiency of the proposed system is illustrated by conducting several experiments on MovieLens dataset.

Design of a Recommendation System for Improving Deep Neural Network Performance

  • Juhyoung Sung;Kiwon Kwon;Byoungchul Song
    • Journal of Internet Computing and Services
    • /
    • v.25 no.1
    • /
    • pp.49-56
    • /
    • 2024
  • There have been emerging many use-cases applying recommendation systems especially in online platform. Although the performance of recommendation systems is affected by a variety of factors, selecting appropriate features is difficult since most of recommendation systems have sparse data. Conventional matrix factorization (MF) method is a basic way to handle with problems in the recommendation systems. However, the MF based scheme cannot reflect non-linearity characteristics well. As deep learning technology has been attracted widely, a deep neural network (DNN) framework based collaborative filtering (CF) was introduced to complement the non-linearity issue. However, there is still a problem related to feature embedding for use as input to the DNN. In this paper, we propose an effective method using singular value decomposition (SVD) based feature embedding for improving the DNN performance of recommendation algorithms. We evaluate the performance of recommendation systems using MovieLens dataset and show the proposed scheme outperforms the existing methods. Moreover, we analyze the performance according to the number of latent features in the proposed algorithm. We expect that the proposed scheme can be applied to the generalized recommendation systems.

A Study on the Leisure Life Satisfaction of College Students According to the Pattern of Leisure Activities (대학생의 여가활동 유형에 따른 여가생활 만족도)

  • An, Ok-Hee;Choi, Hyun-Sook
    • Journal of Family Resource Management and Policy Review
    • /
    • v.10 no.1
    • /
    • pp.53-66
    • /
    • 2006
  • This study was designed to get basic informations for the purpose of making healthy leisure environment of college students, and which will improve the satisfaction of their school life. Five hundreds of college students in Daegu and Gyeongbuk area were questioned by, our questionnaire during April, 2005. The data of 405 students (165 men, 240 women) Were analyzed by SPSS WIN 12.0 program. The data of 210 were from Daegu and 195 were from Gyeongbuk area, The results are as follows, First, $80\%$ of those questioned spend their leisure time doing some activities and the satisfaction degree was medium... They get the informations about leisure mainly through internet and the purpose of their leisure activities, were, to get rid of stress. Second; It was shown that their main leisure activities were doing internet, meeting friends, and listening music on weekdays, meeting friends, watching movie and doing internet on weekend. The major activities of the students during vocation were meeting friends, doing internet, and watching TV. Third, the students are concern about their leisure life, and they think that leisure life make improve the quality of life. The last, there is a correlation between quite activities such as watching TV, and dynamic activities such as a mountain-climbing leisure life satisfaction on weekdays. On weekend, however, there is a correlation between dynamic activities such as sports and the leisure life satisfaction. Moreover, on summer (winter) break personal activities such as religious activities and the leisure satisfaction.

  • PDF

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.

Network Security System for Next Generation Network Environment (차세대 네트워크 보안 시스템)

  • 정연서;김환국;서동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.795-799
    • /
    • 2003
  • Computing and Networking technologies are rapidly developed. Currently, Internet environment can offer voice, multimedia data as well as real-time movie services. But, the number of hacking has increased very much and the damages become serious. In this paper, the change of hacking method and security paradigm is investigated. And, we study in existing network security systems including newly developed security systems. Finally, we describe development directions of network sorority system for next generation network environment.

  • PDF

Implementation of Illegal and Objectionable Multimedia Retrieval Using the MPEG-7 Visual Descriptor and Multi-Class SVM (MPEG-7 시각서술자와 Multi-Class SVM을 이용한 불법 및 유해 멀티미디어 분석 시스템 구현)

  • Choi, Byeong-Cheol;Kim, Jung-Nyeo;Ryou, Jea-Cheol
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.711-712
    • /
    • 2008
  • We developed a XMAS (X Multimedia Analysis System) for analyzing the illegal and objectionable multimedia in Internet environment based on Web2.0. XMAS uses the MPEG-7 visual descriptor and multi-class SVM (support vector machine) and its performance (accuracy on precision) is about 91.6% for objectionable multimedia analysis and 99.9% for illegal movie retrieval.

  • PDF

A Study of Fashion Expression on the end of 20th Century -Focusing on Distopia-

  • Song, Young-Kyoung
    • Journal of Fashion Business
    • /
    • v.8 no.6
    • /
    • pp.123-136
    • /
    • 2004
  • The purpose of this the end of 20th century fashion about various phenomenon of distopia. This study have the analysis and consideration through the elements and peculiarity of distopia. This study give us the various figures of distopia st fashion as well as the common features of distopia. The study method refers to sundry records, thesis, fashion magazine, publication, the collection works and internet. It is as follows. 'Distopia' prefix to dis of Utopia and means unknown future. Distopia trends towards future negatively. The end of 20th century, it is well brought out various cultures. Movie, novel and pop culture have effect on end of the 20th fashion with a view of distopia. It is the fear and uncertainty of the future. The characters of distopia through the works are divided into formative characteristics and aesthetics meaning. The future fashion of distopia expression mixed and various cultural life, also the mixed of utopia and distopia fashion. Distopia stimulates the designers to the new expression and expose their new areas.

Simple Bayesian Model for Improvement of Collaborative Filtering (협업 필터링 개선을 위한 베이지안 모형 개발)

  • Lee, Young-Chan
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.05a
    • /
    • pp.232-239
    • /
    • 2005
  • Collaborative-filtering-enabled Web sites that recommend books, CDs, movies, and so on, have become very popular on the Internet. Such sites recommend items to a user on the basis of the opinions of other users with similar tastes. This paper discuss an approach to collaborative filtering based on the Simple Bayesian and apply this model to two variants of the collaborative filtering. One is user-based collaborative filtering, which makes predictions based on the users' similarities. The other is item-based collaborative filtering which makes predictions based on the items' similarities. To evaluate the proposed algorithms, this paper used a database of movie recommendations. Empirical results show that the proposed Bayesian approaches outperform typical correlation-based collaborative filtering algorithms.

  • PDF

Learning Algorithms in AI System and Services

  • Jeong, Young-Sik;Park, Jong Hyuk
    • Journal of Information Processing Systems
    • /
    • v.15 no.5
    • /
    • pp.1029-1035
    • /
    • 2019
  • In recent years, artificial intelligence (AI) services have become one of the most essential parts to extend human capabilities in various fields such as face recognition for security, weather prediction, and so on. Various learning algorithms for existing AI services are utilized, such as classification, regression, and deep learning, to increase accuracy and efficiency for humans. Nonetheless, these services face many challenges such as fake news spread on social media, stock selection, and volatility delay in stock prediction systems and inaccurate movie-based recommendation systems. In this paper, various algorithms are presented to mitigate these issues in different systems and services. Convolutional neural network algorithms are used for detecting fake news in Korean language with a Word-Embedded model. It is based on k-clique and data mining and increased accuracy in personalized recommendation-based services stock selection and volatility delay in stock prediction. Other algorithms like multi-level fusion processing address problems of lack of real-time database.