• Title/Summary/Keyword: 비디오 마이닝

Search Result 16, Processing Time 0.023 seconds

Pandemics Era, A Study one the Viewers' Responses of Medical Drama through Text Mining. -Focused on - (팬데믹 시대, 텍스트 마이닝을 통한 의학드라마의 시청자 반응 연구-<슬기로운 의사생활>을 중심으로-)

  • Ahn, Sunghun;Oh, SeJong;Jeong, Dalyoung
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.4
    • /
    • pp.385-389
    • /
    • 2020
  • The medical drama has developed into a story centered on 'people', raising viewers' sympathy. The story of the drama is the true life story of doctors, patients and families. It is also a story that reminds me of 'a little special day of our ordinary people'. And the song played and sung by five characters in the drama became a factor that stimulates nostalgia and increases immersion. The highest viewer rating was 14.1%, and 51,584 blogs alone were registered. According to the big data analysis, the related words were 'Wise OST', 'Album Name', 'Artist Name', 'Two Hours in a row', 'Record', 'Remake', 'OST Revealed', 'Advertisement Revenue', 'Playlist', 'Aroha' and 'Cho Jung-seok'. The commercialization of medical dramas includes 'Sales of Drama OST Albums', 'Organizing Online Live Concerts (PPL in Advertising)', 'Publishing Piano Music', 'Picture of People-Oriented Photography', 'Making Music Video Editing Drama Highlight', 'YouTube Upload Profits', 'Mask' and 'Disinfectant'. it is predicted that the touching story of Corona 19 and the charming humanity will unfold. The limitations of the research will require analysis of various works by genre and attempts to analyze consumer values by industry.

A Study of Similarity Measures on Multidimensional Data Sequences Using Semantic Information (의미 정보를 이용한 다차원 데이터 시퀀스의 유사성 척도 연구)

  • Lee, Seok-Lyong;Lee, Ju-Hong;Chun, Seok-Ju
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.283-292
    • /
    • 2003
  • One-dimensional time-series data have been studied in various database applications such as data mining and data warehousing. However, in the current complex business environment, multidimensional data sequences (MDS') become increasingly important in addition to one-dimensional time-series data. For example, a video stream can be modeled as an MDS in the multidimensional space with respect to color and texture attributes. In this paper, we propose the effective similarity measures on which the similar pattern retrieval is based. An MDS is partitioned into segments, each of which is represented by various geometric and semantic features. The similarity measures are defined on the basis of these segments. Using the measures, irrelevant segments are pruned from a database with respect to a given query. Both data sequences and query sequences are partitioned into segments, and the query processing is based upon the comparison of the features between data and query segments, instead of scanning all data elements of entire sequences.

Robust Feature Selection and Shot Change Detection Method Using the Neural Networks (강인한 특징 변수 선별과 신경망을 이용한 장면 전환점 검출 기법)

  • Hong, Seung-Bum;Hong, Gyo-Young
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.7
    • /
    • pp.877-885
    • /
    • 2004
  • In this paper, we propose an enhancement shot change detection method using the neural net and the robust feature selection out of multiple features. The previous shot change detection methods usually used single feature and fixed threshold between consecutive frames. However, contents such as color, shape, background, and texture change simultaneously at shot change points in a video sequence. Therefore, in this paper, we detect the shot changes effectively using robust features, which are supplementary each other, rather than using single feature. In this paper, we use the typical CART (classification and regression tree) of data mining method to select the robust features, and the backpropagation neural net to determine the threshold of the each selected features. And to evaluation the performance of the robust feature selection, we compare the proposed method to the PCA(principal component analysis) method of the typical feature selection. According to the experimental result. it was revealed that the performance of our method had better that than the PCA method.

  • PDF

Identifying Social Relationships using Text Analysis for Social Chatbots (소셜챗봇 구축에 필요한 관계성 추론을 위한 텍스트마이닝 방법)

  • Kim, Jeonghun;Kwon, Ohbyung
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.4
    • /
    • pp.85-110
    • /
    • 2018
  • A chatbot is an interactive assistant that utilizes many communication modes: voice, images, video, or text. It is an artificial intelligence-based application that responds to users' needs or solves problems during user-friendly conversation. However, the current version of the chatbot is focused on understanding and performing tasks requested by the user; its ability to generate personalized conversation suitable for relationship-building is limited. Recognizing the need to build a relationship and making suitable conversation is more important for social chatbots who require social skills similar to those of problem-solving chatbots like the intelligent personal assistant. The purpose of this study is to propose a text analysis method that evaluates relationships between chatbots and users based on content input by the user and adapted to the communication situation, enabling the chatbot to conduct suitable conversations. To evaluate the performance of this method, we examined learning and verified the results using actual SNS conversation records. The results of the analysis will aid in implementation of the social chatbot, as this method yields excellent results even when the private profile information of the user is excluded for privacy reasons.

Online Document Mining Approach to Predicting Crowdfunding Success (온라인 문서 마이닝 접근법을 활용한 크라우드펀딩의 성공여부 예측 방법)

  • Nam, Suhyeon;Jin, Yoonsun;Kwon, Ohbyung
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.3
    • /
    • pp.45-66
    • /
    • 2018
  • Crowdfunding has become more popular than angel funding for fundraising by venture companies. Identification of success factors may be useful for fundraisers and investors to make decisions related to crowdfunding projects and predict a priori whether they will be successful or not. Recent studies have suggested several numeric factors, such as project goals and the number of associated SNS, studying how these affect the success of crowdfunding campaigns. However, prediction of the success of crowdfunding campaigns via non-numeric and unstructured data is not yet possible, especially through analysis of structural characteristics of documents introducing projects in need of funding. Analysis of these documents is promising because they are open and inexpensive to obtain. We propose a novel method to predict the success of a crowdfunding project based on the introductory text. To test the performance of the proposed method, in our study, texts related to 1,980 actual crowdfunding projects were collected and empirically analyzed. From the text data set, the following details about the projects were collected: category, number of replies, funding goal, fundraising method, reward, number of SNS followers, number of images and videos, and miscellaneous numeric data. These factors were identified as significant input features to be used in classification algorithms. The results suggest that the proposed method outperforms other recently proposed, non-text-based methods in terms of accuracy, F-score, and elapsed time.

Design and Implementation of High-dimensional Index Structure for the support of Concurrency Control (필터링에 기반한 고차원 색인구조의 동시성 제어기법의 설계 및 구현)

  • Lee, Yong-Ju;Chang, Jae-Woo;Kim, Hang-Young;Kim, Myung-Joon
    • The KIPS Transactions:PartD
    • /
    • v.10D no.1
    • /
    • pp.1-12
    • /
    • 2003
  • Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.