Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/249502
Title: | SEMANTIC KNOWLEDGE GRAPH REPRESENTATION AND ACQUISITION | Authors: | GUO JIA | ORCID iD: | orcid.org/0009-0004-6933-5199 | Keywords: | Knowledge Graph, Semantic Graph, Relation Extraction, Text Mining, Natural Language Processing, Knowledge Management | Issue Date: | 9-Jan-2024 | Citation: | GUO JIA (2024-01-09). SEMANTIC KNOWLEDGE GRAPH REPRESENTATION AND ACQUISITION. ScholarBank@NUS Repository. | Abstract: | This thesis develops a systematic framework for effectively constructing and representing semantic knowledge graphs, aiding knowledge management in information systems. Firstly, we introduce a biquaternion-based knowledge graph embedding method that integrates multiple geometric transformations (i.e., scaling, translation, Euclidean rotation, and hyperbolic rotation) to enhance representation and reasoning efficacy for various relation patterns. Next, we present a novel method for document-level relation extraction, focusing on better integration of discriminability and robustness. Our loss function enhances discriminability in both probabilistic outputs and internal representations, along with a negative label sampling strategy to mitigate annotation noise. Lastly, we explore the automatic identification of semantic nodes and relations from argumentative corpora. We propose a challenging argument quadruplet extraction task. To support this task, we build a large-scale dataset and propose a novel quad-tagging augmented generative approach. Extensive experiments validate the superiority of our proposed methods over several strong baselines. | URI: | https://scholarbank.nus.edu.sg/handle/10635/249502 |
Appears in Collections: | Ph.D Theses (Open) |
Show full item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
GuoJ.pdf | 1.26 MB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.