面向关系的面向面知识库搜索方法

Taro Aso, T. Amagasa, H. Kitagawa
{"title":"面向关系的面向面知识库搜索方法","authors":"Taro Aso, T. Amagasa, H. Kitagawa","doi":"10.1145/3428757.3429254","DOIUrl":null,"url":null,"abstract":"We propose a relation-oriented faceted search method for knowledge bases (KBs) that allows users to explore relations between entities. KBs store a wide range of knowledge about real-world entities in a structured form as (subject, predicate, object). Although it is possible to query entities and relations among entities by specifying appropriate query expressions of SPARQL or keyword queries, the structure and the vocabulary are complicated and it is hard for non-expert users to get the desired information. For this reason, many researchers have proposed faceted search interfaces for KBs. Nevertheless, existing ones are designed for finding entities and are insufficient for finding relations. To this problem, we propose a novel \"relation facet\" to find relations between entities. To generate it, we apply clustering over predicates based on the Jaccard similarity. We experimentally show the proposed scheme performs better than existing ones in the task of searching relations.","PeriodicalId":212557,"journal":{"name":"Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Relation-oriented faceted search method for knowledge bases\",\"authors\":\"Taro Aso, T. Amagasa, H. Kitagawa\",\"doi\":\"10.1145/3428757.3429254\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a relation-oriented faceted search method for knowledge bases (KBs) that allows users to explore relations between entities. KBs store a wide range of knowledge about real-world entities in a structured form as (subject, predicate, object). Although it is possible to query entities and relations among entities by specifying appropriate query expressions of SPARQL or keyword queries, the structure and the vocabulary are complicated and it is hard for non-expert users to get the desired information. For this reason, many researchers have proposed faceted search interfaces for KBs. Nevertheless, existing ones are designed for finding entities and are insufficient for finding relations. To this problem, we propose a novel \\\"relation facet\\\" to find relations between entities. To generate it, we apply clustering over predicates based on the Jaccard similarity. We experimentally show the proposed scheme performs better than existing ones in the task of searching relations.\",\"PeriodicalId\":212557,\"journal\":{\"name\":\"Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3428757.3429254\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3428757.3429254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

我们提出了一种面向关系的知识库(KBs)面搜索方法,允许用户探索实体之间的关系。KBs以结构化的形式(主语、谓语、宾语)存储关于现实世界实体的广泛知识。虽然可以通过指定适当的SPARQL查询表达式或关键字查询来查询实体和实体之间的关系,但其结构和词汇表比较复杂,非专业用户很难获得所需的信息。由于这个原因,许多研究人员提出了面向KBs的搜索接口。然而,现有的方法是为寻找实体而设计的,不足以寻找关系。针对这个问题,我们提出了一种新的“关系面”来寻找实体之间的关系。为了生成它,我们基于Jaccard相似性对谓词应用聚类。实验结果表明,该算法在关系搜索任务中的性能优于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Relation-oriented faceted search method for knowledge bases
We propose a relation-oriented faceted search method for knowledge bases (KBs) that allows users to explore relations between entities. KBs store a wide range of knowledge about real-world entities in a structured form as (subject, predicate, object). Although it is possible to query entities and relations among entities by specifying appropriate query expressions of SPARQL or keyword queries, the structure and the vocabulary are complicated and it is hard for non-expert users to get the desired information. For this reason, many researchers have proposed faceted search interfaces for KBs. Nevertheless, existing ones are designed for finding entities and are insufficient for finding relations. To this problem, we propose a novel "relation facet" to find relations between entities. To generate it, we apply clustering over predicates based on the Jaccard similarity. We experimentally show the proposed scheme performs better than existing ones in the task of searching relations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信