Proceedings of the 11th on Knowledge Capture Conference最新文献_第3页

Predicting SPARQL Query Dynamics 预测SPARQL查询动态

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493565

Alberto Moya Loustaunau, A. Hogan

引用次数: 1

Providing Humanitarian Relief Support through Knowledge Graphs 通过知识图谱提供人道主义救援支持

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493581

Rui Zhu, Ling Cai, Gengchen Mai, C. Shimizu, C. Fisher, K. Janowicz, Anna Lopez-Carr, A. Schroeder, M. Schildhauer, Yuanyuan Tian, Shirly Stephen, Zilong Liu

引用次数: 3

The Challenges of Cross-Document Coreference Resolution for Email 电子邮件跨文档共同参考解析的挑战

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493573

Xue Li, Sara Magliacane, Paul Groth

引用次数: 0

Efficient RDF Knowledge Graph Partitioning Using Querying Workload 基于查询工作负载的RDF知识图高效分区

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493577

A. Akhter, Muhammad Saleem, Alexander Bigerl, A. N. Ngomo

引用次数: 2

ASSET: A Semi-supervised Approach for Entity Typing in Knowledge Graphs 资产:知识图中实体类型的半监督方法

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493563

Hamada M. Zahera, Stefan Heindorf, A. N. Ngomo

引用次数: 4

Knowledge Extraction from Auto-Encoders on Anomaly Detection Tasks Using Co-activation Graphs 基于协同激活图的异常检测任务自编码器知识提取

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493571

Daniyal Selani, Ilaria Tiddi

引用次数: 0

RML2SHACL: RDF Generation Taking Shape RDF生成正在形成

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493562

Thomas Delva, B. De Smedt, Sitt Min Oo, Dylan Van Assche, S. Lieber, Anastasia Dimou

{"title":"RML2SHACL: RDF Generation Taking Shape","authors":"Thomas Delva, B. De Smedt, Sitt Min Oo, Dylan Van Assche, S. Lieber, Anastasia Dimou","doi":"10.1145/3460210.3493562","DOIUrl":"https://doi.org/10.1145/3460210.3493562","url":null,"abstract":"RDF graphs are often generated by mapping data in other (semi-)structured data formats to RDF. Such mapped graphs have a repetitive structure defined by (i) the mapping rules and (ii) the schema of the input sources. However, this information is not exploited beyond its original scope. SHACL was recently introduced to model constraints that RDF graphs should validate. SHACL shapes and their constraints are either manually defined or derived from ontologies or RDF graphs. We investigate a method to derive the shapes and their constraints from mapping rules, allowing the generation of the RDF graph and the corresponding shapes in one step. In this paper, we present RML2SHACL: an approach to generate SHACL shapes that validate RDF graphs defined by RML mapping rules. RML2SHACL relies on our proposed set of correspondences between RML and SHACL constructs. RML2SHACL covers a large variety of RML constructs, as proven by generating shapes for the RML test cases. A comparative analysis shows that shapes generated by RML2SHACL are similar to shapes generated by ontology-based tools, with a larger focus on data value-based constraints instead of schema-based constraints. We also found that RML2SHACL has a faster execution time than data-graph based approaches for data sizes of 90MB and higher.","PeriodicalId":377331,"journal":{"name":"Proceedings of the 11th on Knowledge Capture Conference","volume":"7 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122744666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Toward Measuring the Resemblance of Embedding Models for Evolving Ontologies 演化本体嵌入模型相似性度量研究

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493540

Romana Pernisch, Daniele Dell'Aglio, A. Bernstein

{"title":"Toward Measuring the Resemblance of Embedding Models for Evolving Ontologies","authors":"Romana Pernisch, Daniele Dell'Aglio, A. Bernstein","doi":"10.1145/3460210.3493540","DOIUrl":"https://doi.org/10.1145/3460210.3493540","url":null,"abstract":"Updates on ontologies affect the operations built on top of them. But not all changes are equal: some updates drastically change the result of operations; others lead to minor variations, if any. Hence, estimating the impact of a change ex-ante is highly important, as it might make ontology engineers aware of the consequences of their action during editing. However, in order to estimate the impact of changes, we need to understand how to measure them. To address this gap for embeddings, we propose a new measure called Embedding Resemblance Indicator (ERI), which takes into account both the stochasticity of learning embeddings as well as the shortcomings of established comparison methods. We base ERI on (i) a similarity score, (ii) a robustness factor $hatμ $ (based on the embedding method, similarity measure, and dataset), and (iii) the number of added or deleted entities to the embedding computed with the Jaccard index. To evaluate ERI, we investigate its usage in the context of two biomedical ontologies and three embedding methods---GraRep, LINE, and DeepWalk---as well as the two standard benchmark datasets---FB15k-237 and Wordnet-18-RR---with TransE and RESCAL embeddings. To study different aspects of ERI, we introduce synthetic changes in the knowledge graphs, generating two test-cases with five versions each and compare their impact with the expected behaviour. Our studies suggests that ERI behaves as expected and captures the similarity of embeddings based on the severity of changes. ERI is crucial for enabling further studies into impact of changes on embeddings.","PeriodicalId":377331,"journal":{"name":"Proceedings of the 11th on Knowledge Capture Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115026555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Blockchain for Trustworthy Publication and Integration of Linked Open Data 区块链用于可信发布和链接开放数据集成

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493572

Fabian Kirstein, M. Hauswirth

{"title":"Blockchain for Trustworthy Publication and Integration of Linked Open Data","authors":"Fabian Kirstein, M. Hauswirth","doi":"10.1145/3460210.3493572","DOIUrl":"https://doi.org/10.1145/3460210.3493572","url":null,"abstract":"The timely, traceable and provenance-aware publication of Linked Open Data (LOD) is crucial for its success and to fulfill the vision of a global, decentralized, and machine-readable database of knowledge. Yet, the access to LOD is still fragmented and mainly centralized aggregations are being used, relying on complex harvesting mechanisms. As a remedy, we propose a blockchain-based approach enabling an integrated, traceable, and timely view on LOD. We use a blockchain to meet the organizational requirements of publishing LOD in a decentralized fashion while still supporting the sovereignty of the data providers and supporting provenance and proper integration into a harmonized knowledge graph. We present an approach and an implemented system that fulfills the requirements regarding volume and throughput and can be used as the foundation for practical deployments. We use Linked Open Government Data (LOGD) as our case study to demonstrate the feasibility of our approach. We developed a prototype to address the specific requirements of LOGD publication and apply the Practical Byzantine Fault Tolerance algorithm at its core to enable a robust state replication.","PeriodicalId":377331,"journal":{"name":"Proceedings of the 11th on Knowledge Capture Conference","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122773182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Dynamic Workflow Composition with OSLO-steps: Data Re-use and Simplification of Automated Administration 使用oslo步骤的动态工作流组合:数据重用和自动化管理的简化

Proceedings of the 11th on Knowledge Capture Conference Pub Date : 2021-12-02 DOI: 10.1145/3460210.3493559

Dörthe Arndt, S. Lieber, Raf Buyle, S. Goossens, David De Block, B. Meester, E. Mannens

引用次数: 0