Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Computer Science and Information Engineering / 資訊工程學系
  4. A Formalization of Semantic Graph Walk Inference
 
  • Details

A Formalization of Semantic Graph Walk Inference

Date Issued
2014
Date
2014
Author(s)
KIRMIZI, HAKKI CANER
URI
http://ntur.lib.ntu.edu.tw//handle/246246/261424
Abstract
Enabling commonsense reasoning is an important task for intelligent agents. The very first requirement of commonsense reasoning problem is a large knowledge base containing basic facts and the semantic relations between these facts. As a knowledge base gradually becomes larger, knowledge management becomes more complex. Rather than requiring all semantic relations between concepts are present in a semantic network, a system which is provided a basic set of facts and an inference mechanism can easily discover new relationships and likewise infer new knowledge. This study attempts to address the need of such an inference mechanism and to present an inference method for this purpose. In this study, I offer another perspective to formalize commonsense reasoning problem in terms of semantic graph walk problem. Considering the knowledge base is encoded as a semantic hypergraph, reasoning can be formulated as a process to discover hidden relations between concepts. Likewise, semantic graph walk formalization allows the reasoning agents not to require all semantic relations between the concepts are present in their knowledge base and to be able to infer new knowledge by composing semantic relations in a graph walk manner. Although this study focuses on a specific domain, emph{i.e.} commonsense semantic networks, the composition mechanism encapsulates a generic method for so-called digraphs. Because each specific link is represented by a unique vector, the method can be generalized for all type of hypergraphs for discovering new links. An analysis of the experiments for semantic graph walk inference on top of ConceptNet 5 commonsense knowledge base demonstrates that there are strong heuristics that can be provided by relation composition method in terms of reasoning. The study also evaluates the shortcomings of ConceptNet definition of semantic networks as well as a few novel directions that semantic graph walk inference method might be used in the future.
Subjects
知識建模
推理引擎
語意關係合成
常識推理
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-103-R00922148-1.pdf

Size

23.32 KB

Format

Adobe PDF

Checksum

(MD5):e7642c6886d47e5ea7aa7402aced05a0

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science