• Annual Conference on Human and Language Technology
• /
• 2021.10a
• /
• pp.482-485
• /
• 2021

최근 지식 그래프를 확장하기 위해 많은 연구가 진행되고 있다. 지식 그래프를 확장하기 위해서는 relation을 기준으로 entity의 방향성을 고려하는 것이 매우 중요하다. 지식 그래프를 확장하기 위한 대표적인 연구인 관계 추출은 문장과 2개의 entity가 주어졌을 때 relation을 예측한다. 최근 사전학습 언어모델을 적용하여 관계 추출에서 높은 성능을 보이고 있지만, entity에 대한 방향성을 고려하여 relation을 예측하는지 알 수 없다. 본 논문에서는 관계 추출에서 entity의 방향성을 고려하여 relation을 예측하는지 실험하기 위해 문장 수준의 Adversarial Attack과 단어 수준의 Sequence Labeling을 적용하였다. 또한 관계 추출에서 문장에 대한 이해를 높이기 위해 BERT모델을 적용하여 실험을 진행하였다. 실험 결과 관계 추출에서 entity에 대한 방향성을 고려하지 않음을 확인하였다.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.415-421
• /
• 2007

This paper proposes a convolution tree kernel-based approach for relation extraction where the parse tree is expanded with entity features such as entity type, subtype, and mention level etc. Our study indicates that not only can our method effectively capture both syntactic structure and entity information of relation instances, but also can avoid the difficulty with tuning the parameters in composite kernels. We also demonstrate that predicate verb information can be used to further improve the performance, though its enhancement is limited. Evaluation on the ACE2004 benchmark corpus shows that our system slightly outperforms both the previous best-reported feature-based and kernel-based systems.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.349-357
• /
• 2007

Named entities (NEs) are important in many Natural Language Processing (NLP) applications, and discovering NE-related relations in texts may be beneficial for these applications. This paper proposes a method to extract the ISA relation between a "named entity" and its category, and an IS-RELATED-TO relation between the category and its related object. Based on the pattern extraction algorithm "Person Category Extraction" (PCE), we extend it for solving our problem. Our experiments on Wall Street Journal (WSJ) corpus show promising results. We also demonstrate a possible application of these relations by utilizing them for semantic search.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.479-486
• /
• 2013

The data model that can be said as skeleton of the information system constitutes important 2 axles in the information system together with the process model. There is entity, properties, relation as key factors of the data model, and entity is the most fundamental factor in the data model, and thus total data model becomes vague if not deriving entity definitely. This study dealt with entity deduction only. Deducing methods of existing entity depended on experiences, task knowledge of designers and clear procedures were not suggested, so there were many difficulties in approaching them from beginners or unskilled persons. For giving helps in solving the problem, this study proposes entity- deducing procedures based on tasks that can derive entity with a systematic process at previously derived target businesses through suggested methods from advancing researches. And the study enabled proposing procedures on imaginary tasks to be applied, objecting to undergraduates who had not experiences on the data modeling, and then verified suggesting process through a similarity checking between best answers with deduced entity by students after taking impossible points of comparing existing methods with suggesting process into consideration. By doing so, deducing entity closely to the best answer was confirmed accordingly. Therefore, a fact could be confirmed that beginners were able to deduce entity closely to the best answer even if letting beginners who had not experiences on the data modeling be applied to unfamiliar tasks. Regarding researches on properties and relation deduction besides entity, this study leaves them to next time.

• Journal of Information Science Theory and Practice
• /
• v.6 no.4
• /
• pp.28-38
• /
• 2018

Wikipedia is composed of millions of articles, each of which explains a particular entity with various languages in the real world. Since the articles are contributed and edited by a large population of diverse experts with no specific authority, Wikipedia can be seen as a naturally occurring body of human knowledge. In this paper, we propose a method to automatically identify key entities and relations in Wikipedia articles, which can be used for automatic ontology construction. Compared to previous approaches to entity and relation extraction and/or identification from text, our goal is to capture naturally occurring entities and relations from Wikipedia while minimizing artificiality often introduced at the stages of constructing training and testing data. The titles of the articles and anchored phrases in their text are regarded as entities, and their types are automatically classified with minimal training. We attempt to automatically detect and identify possible relations among the entities based on clustering without training data, as opposed to the relation extraction approach that focuses on improvement of accuracy in selecting one of the several target relations for a given pair of entities. While the relation extraction approach with supervised learning requires a significant amount of annotation efforts for a predefined set of relations, our approach attempts to discover relations as they occur naturally. Unlike other unsupervised relation identification work where evaluation of automatically identified relations is done with the correct relations determined a priori by human judges, we attempted to evaluate appropriateness of the naturally occurring clusters of relations involving person-artifact and person-organization entities and their relation names.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.1
• /
• pp.57-62
• /
• 2010

This paper proposes two methods for the construction of job offer and job hunting information in order to supply an environment that can easily connects to job hunting information. First, the database expansion, category rules and ERD(Entity Relation Diagram) are designed for the construction of job hunting site with real example. Second, the prime number labeling rules are designed for the strong intimacy of label rules. Therefore, according to using the systematic and regular rules when we design and construct a database, the consistency and efficiency are improved in the database being constructed and being operated. And the convenience of application program development and operation are easily provided. In addition, the proposed code-expansion rule can be defined and be standardized in the domestic and foreign job offer and job hunting information provision agency.

• Journal of the Korean Society for Library and Information Science
• /
• v.51 no.4
• /
• pp.227-248
• /
• 2017

This paper introduces an integrated model for systematically constructing a linguistic resource database that can be used by machine learning-based biomedical information extraction systems. The proposed method suggests an orderly process of collecting and constructing dictionaries and training sets for both named-entity recognition and relation extraction. Multiple heterogeneous structures for the resources which are collected from diverse sources are analyzed to derive essential items and fields for constructing the integrated database. All the collected resources are converted and refined to build an integrated linguistic resource storage. In this paper, we constructed entity dictionaries of gene, protein, disease and drug, which are considered core linguistic elements or core named entities in the biomedical domains and conducted verification tests to measure their acceptability.

• Journal of the Korean Society for Library and Information Science
• /
• v.57 no.1
• /
• pp.93-114
• /
• 2023

Information extraction can facilitate the intensive analysis of documents by providing semantic triples which consist of named entities and their relations recognized in the texts. However, most of the research so far has been carried out separately for named entity recognition and relation extraction as individual studies, and as a result, the effective performance evaluation of the entire information extraction systems was not performed properly. This paper introduces two models of end-to-end information extraction that can extract various entity names in clinical records and their relationships in the form of semantic triples, namely pipeline and joint models and compares their performances in depth. The pipeline model consists of an entity recognition sub-system based on bidirectional GRU-CRFs and a relation extraction module using multiple encoding scheme, whereas the joint model was implemented with a single bidirectional GRU-CRFs equipped with multi-head labeling method. In the experiments using i2b2/VA 2010, the performance of the pipeline model was 5.5% (F-measure) higher. In addition, through a comparative experiment with existing state-of-the-art systems using large-scale neural language models and manually constructed features, the objective performance level of the end-to-end models implemented in this paper could be identified properly.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.12-22
• /
• 1995

When we integrate schema of distributed local databases, we mean entity integration as central concept of schema integration, and semantic of entity affects several factors. Thus the schema integration in distributed database environment starts from definition of domain relation among entity types of local schemas. Moreover, the domain relation defined by designer needs some works for confidence and validation of schema integration system. But this work was not presented in previous integration system. In this paper, we define object oriented integration for schema integration of local databases in distributed system environment, present models to verify validation on its integration, and implement the validation system.

• Journal of KIISE:Software and Applications
• /
• v.36 no.8
• /
• pp.642-652
• /
• 2009

In order to improve the performance of the existing relation extraction approaches, we propose a method for combining two pivotal concepts which play an important role in classifying semantic relationships between entities in text. Having built a composite kernel-based relation extraction system, which incorporates both entity features and syntactic structured information of relation instances, we define nine classes of lexical features and synthetically apply them to the system. Evaluation on the ACE RDC corpus shows that our approach boosts the effectiveness of the existing composite kernels in relation extraction. It also confirms that by integrating the three important features (entity features, syntactic structures and contextual lexical features), we can improve the performance of a relation extraction process.