• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.3
• /
• pp.11-21
• /
• 2010

To aim at improving performance and reflecting user's needs of retrieval, the number of researches has been actively conducted in recent year as the quantity of information and generation of the web pages exceedingly increase. One of alternative approaches can be a tagging system. It makes users be able to provide a representation of metadata including writings, pictures, and movies etc. called tag and be convenient in use of retrieval of internet resources. Tags similar to keywords play a critical role in maintaining target pages. However, they still needs time consuming labors to annotate tags, which sometimes are found to be a hinderance caused by overuse of tagging. In this paper, we present an automatic tagging scheme for a solution of current tagging system conveying drawbacks and inconveniences. To realize the approach, face recognition-based tagging system on SNS is proposed by building a face area detection procedure, linear-based classification and boosting algorithm. The proposed novel approach of tagging service can increase possibilities that utilized SNS more efficiently. Experimental results and performance analysis are shown as well.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.485-495
• /
• 2009

We in this paper propose a social network based on ontology in Korea Institute of Oriental Medicine (KIOM). By using the social network, researchers can find collaborators and share research results with others. For this purpose, first, personal profiles, scholarships, careers, licenses, academic activities, research results, and personal connections for all of researchers in KIOM are collected. After relationship and hierarchy among ontology classes and attributes of classes are defined through analyzing the collected information, a social network ontology are constructed using FOAF and OWL. This ontology can be easily interconnected with other social network by FOAF and provide the reasoning based on OWL ontology.

• The Journal of the Korea Contents Association
• /
• v.18 no.2
• /
• pp.438-449
• /
• 2018

Recently, various graph data have been utilized in various fields such as social networks and citation networks. As the graph changes dynamically over time, it is necessary to manage the graph historical data for tracking changes and retrieving point-in-time graphs. Most historical data changes partially according to time, so unchanged data is stored redundantly when data is stored in units of time. In this paper, we propose a graph history storage management method to minimize the redundant storage of time graphs. The proposed method continuously detects the change of the graph and stores the overlapping subgraph in intersection snapshot. Intersection snapshots are connected by a number of delta snapshots to maintain change data over time. It improves space efficiency by collectively managing overlapping data stored in intersection snapshots. We also linked intersection snapshots and delta snapshots to retrieval the graph at that point in time. Various performance evaluations are performed to show the superiority of the proposed scheme.

• The Journal of the Korea Contents Association
• /
• v.20 no.3
• /
• pp.18-30
• /
• 2020

Recently, as graph-structured data is widely used in various fields such as social networks and semantic Webs, needs for an effective and efficient search on a large amount of graph data have been increasing. Previous keyword-based search methods often find results by considering only the relevance to a given query. However, they are likely to produce semantically similar results by selecting answers which have high query relevance but share the same content nodes. To improve the diversity of search results, we propose a top-k search method that finds a set of subtrees which are not only relevant but also diverse in terms of the content nodes by controlling their similarity. We define a criterion for a set of diverse answer trees and design two kinds of diversified top-k search algorithms which are based on incremental enumeration and A^⁎ heuristic search, respectively. We also suggest an improvement on the A^⁎ search algorithm to enhance its performance. We show by experiments using real data sets that the proposed heuristic search method can find relevant answers with diverse content nodes efficiently.

• The Journal of the Korea Contents Association
• /
• v.17 no.8
• /
• pp.619-630
• /
• 2017

With the growing popularity of smart devices, various location based services have been providing to users. Recently, some location based social applications that combine social services and location based services have been emerged. The demands of a k-nearest neighbors(k-NN) query which finds k closest locations from a user location are increased in the location based social network services. In this paper, we propose an approximate k-NN query processing method for fast response time in a large number of users environments. The proposed method performs efficient stream processing using big data distributed processing technologies. In this paper, we also propose a modified grid index method for indexing a large amount of location data. The proposed query processing method first retrieves the related cells by considering a user movement. By doing so, it can make an approximate k results set. In order to show the superiority of the proposed method, we conduct various performance evaluations with the existing method.

• The Journal of Bigdata
• /
• v.4 no.2
• /
• pp.23-34
• /
• 2019

Recently, the crime that utilizes the digital platform is continuously increasing. About 140,000 cases occurred in 2015 and about 150,000 cases occurred in 2016. Therefore, it is considered that there is a limit handling those online crimes by old-fashioned investigation techniques. Investigators' manual online search and cognitive investigation methods those are broadly used today are not enough to proactively cope with rapid changing civil crimes. In addition, the characteristics of the content that is posted to unspecified users of social media makes investigations more difficult. This study suggests the site-based collection and the Open API among the content web collection methods considering the characteristics of the online media where the infringement crimes occur. Since illegal content is published and deleted quickly, and new words and alterations are generated quickly and variously, it is difficult to recognize them quickly by dictionary-based morphological analysis registered manually. In order to solve this problem, we propose a tokenizing method in the existing dictionary-based morphological analysis through WPM (Word Piece Model), which is a data preprocessing method for quick recognizing and responding to illegal contents posting online infringement crimes. In the analysis of data, the optimal precision is verified through the Vote-based ensemble method by utilizing a classification learning model based on supervised learning for the investigation of illegal contents. This study utilizes a sorting algorithm model centering on illegal multilevel business cases to proactively recognize crimes invading the public economy, and presents an empirical study to effectively deal with social data collection and content investigation.

• The Journal of the Korea Contents Association
• /
• v.16 no.6
• /
• pp.205-214
• /
• 2016

As a large amount of graph-structured data is widely used in various applications such as social networks, semantic web, and bio-informatics, keyword-based search over graph data has been getting a lot of attention. In this paper, we propose an efficient method for keyword search over graph data to find a set of top-k answers that are relevant as well as non-redundant in structure. We define a non-redundant answer structure for a keyword query and a relevance measure for the answer. We suggest a new indexing scheme on the relevant paths between nodes and keyword terms in the graph, and also propose a query processing algorithm to find top-k non-redundant answers efficiently by exploiting the pre-calculated indexes. We present effectiveness and efficiency of the proposed approach compared to the previous method by conducting an experiment using a real dataset.

• The Journal of the Korea Contents Association
• /
• v.21 no.8
• /
• pp.546-558
• /
• 2021

This study focused on analyzing the contents of social big data produced in the online space, dealing with issues related to food in the community in the context of COVID-19. First, this study analyzed food-related issues that spread through regional websites and online community(cafes) after social distancing was implemented due to COVID-19. Next, this study analyzed the contents of food-related issues that spread through media news, SNS, and portals. As a result, there were more food-related posts on the homepages of other regions compared to the metropolitan areas such as Seoul and Gyeonggi, but in the case of online communities, there were more food-related issues in online communities registered in Seoul and Gyeonggi regions. Food-related keywords in regional online communities mainly contained content related to the local economy. In the media articles, SNS, and search portal issues, content that can be discussed in the consumption process of local community food-related policies, information, and products mainly appeared. Based on the results of the study, it was found that there is no specialized information sharing system for each community, that online communities can contribute to providing food information applicable to reality, and that it is possible to verify the performance of regional food policies through social media.

• Journal of Food Hygiene and Safety
• /
• v.30 no.4
• /
• pp.329-342
• /
• 2015

The purpose of this study was to investigate consumers' perceptions of sodium saccharin in social media. Data was collected from Naver blogs and Naver web communities (Korean representative portal web-site), and media reports including comment sections on a Yonhap news website (Korean largest news agency). The results from Naver blogs and Naver web communities showed that it was primarily mentioned 'sodium saccharin-no added' products, properties of sodium saccharin, and methods of reducing sodium saccharin in food. When media reported the expansion of food categories permitted to use sodium saccharin, search volume for sodium saccharin has increased in both PC and mobile search engines. Also, it was mainly commented about distrust of government, criticism of food product price, and distrust of food companies below the news on the news site. The label of sodium saccharin-no added products in market emphasized "no added-sodium saccharin". These results suggest that consumers are interested in sodium saccharin and especially when media reported the expansion of food categories permitted to use it. Consumers were able to search various information on sodium saccharin except safety or acceptable daily intake through social media. Therefore media or competent authority should report item on sodium saccharin with information including safety or acceptable daily intake based on scientific background and reference or experts' interview for consumers to get reliable information.

• It's Smart Media
• /
• v.3 no.4
• /
• pp.22-28
• /
• 2014

스마트TV는 TV와 휴대폰, 그리고 컴퓨터 등 여러 개의 스크린을 활용하여 동영상을 볼 수 있는 TV를 의미한다. 스마트TV는 또한 콘텐츠를 인터넷에서 실시간으로 다운받아 볼 수 있고, 스포츠 결과, 사건 사고, 다른 나라의 소식, 그리고 이메일 등을 바로 확인할 수 있는 복합적인 커뮤니케이션 시스템이다. 반면에 이전의 TV는 단순한 방송을 시청하는 도구로 사용되었지만, 최근에 등장한 스마트TV는 방송을 보는 것과 참여하는 것, 그리고 선택하는 것을 포함하고 있다. 즉 TV에 네트워크 기능을 추가하며, 각종 앱을 설치하고, 이러한 앱들을 통해서 정보검색/물건구매, VOD 시청, 인터넷 게임, 소셜네트워크 사용 등 다양한 기능을 활용한다. 본 기사에서는 스마트TV 기술, 구성요소, 그리고 각 제조사별 특징을 분석하고, 스마트TV의 발전 방향 등 스마트TV의 현황 등에 대해서 정리한다.