• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.83-90
• /
• 2015

This paper examines the rising value of social networked journalism and analyzes the case of a social news site based on the theory of networked journalism. Social networked journalism allows the public to be involved in every aspect of journalism production through crowd-sourcing and interactivity. The networking effect with the public is driving journalism to transform into a more open, more networked and more responsive venue. "wikitree" is a social networking news service on which anybody can write news and disseminate it via Facebook and Twitter. It is operated as an open sourced program which incorporates "Google Translate" to automatically convert all its content, enabling any global citizen with an Internet access to contribute news production and share either their own creative contents or generated contents from other sources. Since its inception, "wikitree global" site has been expanding its coverage rapidly with access points arising from 160 countries. Analyzing its international coverage by country and by news category as well as by the unique visit numbers via SNS, the results of the case study imply that networking with the global public can enhance news traffic to the social news site as well as to specific news items. The results also suggest that the utilization of Twitter and Facebook in social networked journalism can break the boundary between local and global public by extending news-gathering ability while growing audience's interest in the site, and engender a feasible business model for a local online journalism.

• 프린팅코리아
• /
• v.12 no.10
• /
• pp.86-89
• /
• 2013

대한인쇄문화협회(회장 김남수)는 8억원의 국고를 지원받아 품질표준화 친환경 인쇄를 위한 PUR접착제, 인쇄세척액, 한자서체, 인쇄품질 공정진단 프로그램 개발 등 4개 부문에서 문화체육관광부 2013년도 콘텐츠산업기술지원사업을 주관하고 있다. 2013년도 콘텐츠산업기술지원사업은 한국콘텐츠진흥원(원장 홍상표)이 주관하는 프로젝트 사업으로 글로벌 진출이 가능한 차세대 전략 R&D 과제 개발로 콘텐츠산업의 글로벌 경쟁력 강화를 목적으로 추진된다. 2013년도 콘텐츠산업기술지원사업 콘트롤타워 역할을 하는 유창준 전무이사가 소셜네트워크 뉴스 서비스 업체인 (주)소셜뉴스가 운영하는 인터넷뉴스 위키트리와 진행한 인터뷰 내용을 전재한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.492-496
• /
• 2010

Wikipedia as an open encyclopedia contains immense human knowledge written by thousands of volunteer editors and its reliability is also high. In this paper, we propose to automatically construct a Korean named entity dictionary using the several features of the Wikipedia. Firstly, we generate class hierarchies using the class information from each article of Wikipedia. Secondly, the titles of each article are mapped to our class hierarchies, and then we calculate the entropy value of the root node in each class hierarchy. Finally, we construct named entity dictionary with high performance by removing the class hierarchies which have a higher entropy value than threshold. Our experiment results achieved overall F1-measure of 81.12% (precision : 83.94%, recall : 78.48%).

• Journal of Digital Convergence
• /
• v.15 no.2
• /
• pp.309-318
• /
• 2017

This study is for analyzing the tone, the frame and the characteristics of political news in social media. Social news media is not same as old media in sharing news freely by SNS like tweeter, facebook and reporting, editing by anyone using SNS with various opinions. With Content analysis, sampling 419 cases from 'Wikitree' by the keyword, 'presidential election', all the full text analysed each how is social media making public opinion differently and which frame is using in. As the result, the social media has different tone, frame, and characteristic due to the reported figure, type of report, information source, attitude to the government, specifically shows a lack of in-depth report and distinct soft-journalism just same as old media's. Because the tone of social news media is not probable, specific but improbable, vague, using the irrational, strategic and episodic frame mainly.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.6
• /
• pp.113-120
• /
• 2024

With the advancement of information and communication technology, we can easily generate various forms of data in our daily lives. To efficiently manage such a large amount of data, systematic classification into categories is essential. For effective search and navigation, data is organized into a tree-like hierarchical structure known as a category tree, which is commonly seen in news websites and Wikipedia. As a result, various techniques have been proposed to classify large volumes of documents into the terminal nodes of category trees. However, document classification methods using category trees face a problem: as the height of the tree increases, the number of terminal nodes multiplies exponentially, which increases the probability of misclassification and ultimately leads to a reduction in classification accuracy. Therefore, in this paper, we propose a new node expansion-based classification algorithm that satisfies the classification accuracy required by the application, while enabling detailed categorization. The proposed method uses a greedy approach to prioritize the expansion of nodes with high classification accuracy, thereby maximizing the overall classification accuracy of the category tree. Experimental results on real data show that the proposed technique provides improved performance over naive methods.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.61-76
• /
• 2015

In general, we have utilized the hierarchical concept tree as a crucial data structure for indexing huge amount of textual data. This paper proposes a generality rank-based method that can automatically develop hierarchical concept structures with the Wikipedia data. The goal of the method is to regard each of Wikipedia articles as a concept and to generate hierarchical relationships among concepts. In order to estimate the generality of concepts, we have devised a special ranking function that mainly uses the number of hyperlinks among Wikipedia articles. The ranking function is effectively used for computing the probabilistic subsumption among concepts, which allows to generate relatively more stable hierarchical structures. Eventually, a set of concept pairs with hierarchical relationship is visualized as a DAG (directed acyclic graph). Through the empirical analysis using the concept hierarchy of Open Directory Project, we proved that the proposed method outperforms a representative baseline method and it can automatically extract concept hierarchies with high accuracy.

• Journal of Intelligence and Information Systems
• /
• v.25 no.3
• /
• pp.161-177
• /
• 2019

In this paper, we study the performance improvement of the answer extraction in Question-Answering system by using sentence dependency parsing result. The Question-Answering (QA) system consists of query analysis, which is a method of analyzing the user's query, and answer extraction, which is a method to extract appropriate answers in the document. And various studies have been conducted on two methods. In order to improve the performance of answer extraction, it is necessary to accurately reflect the grammatical information of sentences. In Korean, because word order structure is free and omission of sentence components is frequent, dependency parsing is a good way to analyze Korean syntax. Therefore, in this study, we improved the performance of the answer extraction by adding the features generated by dependency parsing analysis to the inputs of the answer extraction model (Bidirectional LSTM-CRF). The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. In this study, we compared the performance of the answer extraction model when inputting basic word features generated without the dependency parsing and the performance of the model when inputting the addition of the Eojeol tag feature and dependency graph embedding feature. Since dependency parsing is performed on a basic unit of an Eojeol, which is a component of sentences separated by a space, the tag information of the Eojeol can be obtained as a result of the dependency parsing. The Eojeol tag feature means the tag information of the Eojeol. The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. From the dependency parsing result, a graph is generated from the Eojeol to the node, the dependency between the Eojeol to the edge, and the Eojeol tag to the node label. In this process, an undirected graph is generated or a directed graph is generated according to whether or not the dependency relation direction is considered. To obtain the embedding of the graph, we used Graph2Vec, which is a method of finding the embedding of the graph by the subgraphs constituting a graph. We can specify the maximum path length between nodes in the process of finding subgraphs of a graph. If the maximum path length between nodes is 1, graph embedding is generated only by direct dependency between Eojeol, and graph embedding is generated including indirect dependencies as the maximum path length between nodes becomes larger. In the experiment, the maximum path length between nodes is adjusted differently from 1 to 3 depending on whether direction of dependency is considered or not, and the performance of answer extraction is measured. Experimental results show that both Eojeol tag feature and dependency graph embedding feature improve the performance of answer extraction. In particular, considering the direction of the dependency relation and extracting the dependency graph generated with the maximum path length of 1 in the subgraph extraction process in Graph2Vec as the input of the model, the highest answer extraction performance was shown. As a result of these experiments, we concluded that it is better to take into account the direction of dependence and to consider only the direct connection rather than the indirect dependence between the words. The significance of this study is as follows. First, we improved the performance of answer extraction by adding features using dependency parsing results, taking into account the characteristics of Korean, which is free of word order structure and omission of sentence components. Second, we generated feature of dependency parsing result by learning - based graph embedding method without defining the pattern of dependency between Eojeol. Future research directions are as follows. In this study, the features generated as a result of the dependency parsing are applied only to the answer extraction model in order to grasp the meaning. However, in the future, if the performance is confirmed by applying the features to various natural language processing models such as sentiment analysis or name entity recognition, the validity of the features can be verified more accurately.