DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Suh, Hyo-Won | - |
dc.contributor.advisor | 서효원 | - |
dc.contributor.author | Yun, Byung-Il | - |
dc.date.accessioned | 2022-04-15T01:54:02Z | - |
dc.date.available | 2022-04-15T01:54:02Z | - |
dc.date.issued | 2021 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=962546&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/294600 | - |
dc.description.abstract | The knowledge graph is used in various fields such as search, knowledge inference, and natural language understanding. In particular, recently in the field of natural language understanding, it has been argued that external knowledge is required in addition to the learned language model in order for a machine to generate a more natural language. A knowledge graph is useful for storing and expressing this external knowledge. However, when a person directly builds such a knowledge graph, it consumes a lot of time and money, and it is difficult to immediately update the knowledge. To solve this problem, we propose a method of automatically/semi-automatically building a knowledge graph using natural language processing technology. A knowledge graph is a graph consisting of relationships between words. When expressing knowledge, the most preferentially expressed structure is a taxonomy, that is, a hierarchical structure. Therefore, we first conducted a study to explore the hypernym of words to automatically build a hierarchical structure. Our proposed method is an unsupervised method that does not require large-scale training data.Then, the non-hierarchical relationship is predicted. First, the static word embedding is improved to better express the relationship between words, and then the hidden relationship between words is predicted using the improved word embedding. After extracting the relationship of words in this way, it helps the process of building a knowledge graph. We build a knowledge graph directly from data, and compare it with a pre-built ontology to check whether it can be used in practice. | - |
dc.language | eng | - |
dc.title | Semi-automatic generation of knowledge graph by masked language model and improved skip-gram | - |
dc.title.alternative | 마스크 언어 모델과 개선된 스킵 그램 임베딩을 이용한 반자동 지식 그래프 구축 | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :산업및시스템공학과, | - |
dc.description.isOpenAccess | 학위논문(박사) - 한국과학기술원 : 산업및시스템공학과, 2021.8,[iv, 84 p. :] | - |
dc.publisher.country | 한국과학기술원 | - |
dc.type.journalArticle | Thesis(Ph.D) | - |
dc.contributor.alternativeauthor | 윤병일 | - |
dc.subject.keywordAuthor | Knowledge Graph▼aMasked Language Model▼aSkip-Gram▼aBERT▼aNatural Language Process | - |
dc.subject.keywordAuthor | 지식 그래프▼a마스크 언어 모델▼a스킵 그램▼a버트▼a자연어처리 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.