Proceedings of the 10th International Conference on Knowledge Capture最新文献

筛选
英文 中文
Do your Resources Sound Similar?: On the Impact of Using Phonetic Similarity in Link Discovery 你的资源听起来相似吗?语音相似对链接发现的影响
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364426
A. Ahmed, M. A. Sherif, A. N. Ngomo
{"title":"Do your Resources Sound Similar?: On the Impact of Using Phonetic Similarity in Link Discovery","authors":"A. Ahmed, M. A. Sherif, A. N. Ngomo","doi":"10.1145/3360901.3364426","DOIUrl":"https://doi.org/10.1145/3360901.3364426","url":null,"abstract":"An increasing number of heterogeneous datasets abiding by the Linked Data paradigm is published everyday. Discovering links between these datasets is thus central to achieving the vision behind the Data Web. Declarative Link Discovery (LD) frameworks rely on complex Link Specification (LS) to express the conditions under which two resources should be linked. Complex LS combine similarity measures with thresholds to determine whether a given predicate holds between two resources. State of the art LD frameworks rely mostly on string-based similarity measures such as Levenshtein and Jaccard. However, string-based similarity measures often fail to catch the similarity of resources with phonetically similar property values when these property values are represented using different string representation (e.g., names and street labels). In this paper, we evaluate the impact of using phonetics-based similarities in the process of LD. Moreover, we evaluate the impact of phonetic-based similarity measures on a state-of-the-art machine learning approach used to generate LS. Our experiments suggest that the combination of string-based and phonetic-based measures can improve the F-measures achieved by LD frameworks on most datasets.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116926745","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
More Complete Resultset Retrieval from Large Heterogeneous RDF Sources 从大型异构RDF源获取更完整的结果集
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364436
André Valdestilhas, Tommaso Soru, Muhammad Saleem
{"title":"More Complete Resultset Retrieval from Large Heterogeneous RDF Sources","authors":"André Valdestilhas, Tommaso Soru, Muhammad Saleem","doi":"10.1145/3360901.3364436","DOIUrl":"https://doi.org/10.1145/3360901.3364436","url":null,"abstract":"Over the last years, the Web of Data has grown significantly. Various interfaces such as LOD Stats, LOD Laudromat, SPARQL endpoints provide access to the hundered of thousands of RDF datasets, representing billions of facts. These datasets are available in different formats such as raw data dumps and HDT files or directly accessible via SPARQL endpoints. Querying such large amount of distributed data is particularly challenging and many of these datasets cannot be directly queried using the SPARQL query language. In order to tackle these problems, we present WimuQ, an integrated query engine to execute SPARQL queries and retrieve results from large amount of heterogeneous RDF data sources. Presently, WimuQ is able to execute both federated and non-federated SPARQL queries over a total of 668,166 datasets from LOD Stats and LOD Laudromat as well as 559 active SPARQL endpoints. These data sources represent a total of 221.7 billion triples from more than 5 terabytes of information from datasets retrieved using the service \"Where is My URI\" (WIMU). Our evaluation on state-of-the-art real-data benchmarks shows that WimuQ retrieves more complete results for the benchmark queries.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125406826","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}
引用次数: 3
D-REPR: A Language for Describing and Mapping Diversely-Structured Data Sources to RDF D-REPR:描述和映射不同结构的数据源到RDF的语言
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364449
Binh Vu, J. Pujara, Craig A. Knoblock
{"title":"D-REPR: A Language for Describing and Mapping Diversely-Structured Data Sources to RDF","authors":"Binh Vu, J. Pujara, Craig A. Knoblock","doi":"10.1145/3360901.3364449","DOIUrl":"https://doi.org/10.1145/3360901.3364449","url":null,"abstract":"Publishing data sources to knowledge graphs is a complicated and laborious process as data sources are often heterogeneous, hierarchical and interlinked. As an example, food price datasets may contain product prices of various units at different markets and times, and different providers can have many choices of formats such as CSV, JSON or spreadsheet. Beyond data formats, these datasets may have differing layout, where one dataset may be organized as a row-based table or relational table (prices are in one column), while another may use a matrix table (prices are in one matrix). To address these problems, we present a novel data description language for mapping datasets to RDF. In particular, our language supports specifying the locations of source attributes in the sources, mapping of the attributes to ontologies, and simple rules to join the data of these attributes to output final RDF triples. Unlike existing approaches, our language is not restricted to specific data layouts such as the Nested Relational Model, or to specific data formats, such as spreadsheet. Our broad data description language presents a format-independent solution, allowing interlinking among multiple heterogeneous sources and representing many diverse data structures that existing tools are unable to handle.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134176680","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}
引用次数: 14
Contextual Entity Disambiguation in Domains with Weak Identity Criteria: Disambiguating Golden Age Amsterdamers 弱身份标准域的语境实体消歧:黄金时代阿姆斯特丹人消歧
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364440
A. Idrissou, V. Zamborlini, F. V. Harmelen, Chiara Latronico
{"title":"Contextual Entity Disambiguation in Domains with Weak Identity Criteria: Disambiguating Golden Age Amsterdamers","authors":"A. Idrissou, V. Zamborlini, F. V. Harmelen, Chiara Latronico","doi":"10.1145/3360901.3364440","DOIUrl":"https://doi.org/10.1145/3360901.3364440","url":null,"abstract":"Entity disambiguation is a widely investigated topic, and many matching algorithms have been proposed. However, this task has not yet been satisfactorily addressed when the domain of interest provides poor or incomplete data with little discriminating power. In these cases, the use of content fields such as name and date is not enough and the simple use of relations with other entities is not of much help when these related entities also need disambiguation before they can be used. Therefore, we propose an approach for the disambiguation of clustered resources using context (related entities that are also clustered) as evidence for reconciling matched entities. We test the proposed method on datasets of historical records from Amsterdam in the 17th century for which context is available, and we compare the results of the proposed approach to a gold standard generated by three experts, which we make available online. The results show that the proposed approach manages to meaningfully use context for isolating identity sub-clusters with higher quality by eliminating potentially false positive matches.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117289586","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}
引用次数: 4
Scalable Cross-lingual Document Similarity through Language-specific Concept Hierarchies 通过特定于语言的概念层次结构实现可扩展的跨语言文档相似性
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364444
Carlos Badenes-Olmedo, José Luis Redondo García, Óscar Corcho
{"title":"Scalable Cross-lingual Document Similarity through Language-specific Concept Hierarchies","authors":"Carlos Badenes-Olmedo, José Luis Redondo García, Óscar Corcho","doi":"10.1145/3360901.3364444","DOIUrl":"https://doi.org/10.1145/3360901.3364444","url":null,"abstract":"With the ongoing growth in number of digital articles in a wider set of languages and the expanding use of different languages, we need annotation methods that enable browsing multi-lingual corpora. Multilingual probabilistic topic models have recently emerged as a group of semi-supervised machine learning models that can be used to perform thematic explorations on collections of texts in multiple languages. However, these approaches require theme-aligned training data to create a language-independent space. This constraint limits the amount of scenarios that this technique can offer solutions to train and makes it difficult to scale up to situations where a huge collection of multi-lingual documents are required during the training phase. This paper presents an unsupervised document similarity algorithm that does not require parallel or comparable corpora, or any other type of translation resource. The algorithm annotates topics automatically created from documents in a single language with cross-lingual labels and describes documents by hierarchies of multi-lingual concepts from independently-trained models. Experiments performed on the English, Spanish and French editions of JCR-Acquis corpora reveal promising results on classifying and sorting documents by similar content.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128660844","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}
引用次数: 6
Congenial Benchmarking of RDF Storage Solutions RDF存储解决方案的一致性基准测试
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364429
A. N. Ngomo, Felix Conrads, Maximilian Pensel, Anni-Yasmin Turhan
{"title":"Congenial Benchmarking of RDF Storage Solutions","authors":"A. N. Ngomo, Felix Conrads, Maximilian Pensel, Anni-Yasmin Turhan","doi":"10.1145/3360901.3364429","DOIUrl":"https://doi.org/10.1145/3360901.3364429","url":null,"abstract":"Many SPARQL benchmark generation techniques rely on SPARQL query templates or on selecting representative queries from a set of input queries by inspecting their syntactic features. Hence, prototype queries from such benchmarks mainly capture combinations of SPARQL features, but not the semantics nor the conceptual association between queries. We present congenial benchmarks---a novel type of benchmark that can detect conceptual associations and thus reflect prototypical user intentions when selecting prototype queries. We study SPARROW, an instantiation of congenial benchmarks, where the conceptual associations of SPARQL queries are measured by concept similarity measures. To this end, we transform unary acyclic conjunctive SPARQL queries into ELH-description logic concepts. Our evaluation of three popular triple stores on two datasets shows that the benchmarks generated by SPARROW differ considerably from benchmarks generated using a feature-based approach. Moreover, our evaluation suggests that SPARROW can characterize the performance of common triple stores with respect to user needs by exploiting conceptual associations to detect prototypical user needs.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126778493","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}
引用次数: 0
Mining Process Factor Causality Links with Multi-relational Associations 基于多关系关联的过程因素因果关系挖掘
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364446
Mickael Wajnberg, Petko Valtchev, Mario Lezoche, H. Panetto, A. Massé
{"title":"Mining Process Factor Causality Links with Multi-relational Associations","authors":"Mickael Wajnberg, Petko Valtchev, Mario Lezoche, H. Panetto, A. Massé","doi":"10.1145/3360901.3364446","DOIUrl":"https://doi.org/10.1145/3360901.3364446","url":null,"abstract":"To make knowledge-supported decisions, industrial actors often need to examine available data for suggestive patterns. As industrial data are typically unlabeled and involve multiple object types, unsupervised multi-relational (MR) data mining methods are particularly suitable for the task. Current MR association miners merely produce singleton-conclusions rules hence might miss multi-way dependencies. Our novel MR miner builds upon a relational extension of concept analysis to extract general associations. While successfully dealing with circularity in data, it avoids producing cyclic rules by limiting the description depth of relational concepts. Our rules' relevance was validated by an application to aluminum die casting.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133833591","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
Understanding Financial Transaction Documents using Natural Language Processing 使用自然语言处理理解金融交易文件
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364439
Prateek Jain, Kunal Verma, Aniket Gaikwad, Pramod Gadde
{"title":"Understanding Financial Transaction Documents using Natural Language Processing","authors":"Prateek Jain, Kunal Verma, Aniket Gaikwad, Pramod Gadde","doi":"10.1145/3360901.3364439","DOIUrl":"https://doi.org/10.1145/3360901.3364439","url":null,"abstract":"In this paper, we share our experiences creating NLP based AI platform for finance - Appzen (http://www.appzen.com). AppZen's auditing technology is being utilized by over 500 enterprise customers including multiple Fortune 500 companies for auditing employee expenses. AppZen's technology can process, analyze and identify relationships between various kinds of transaction documents such as - receipts, invoices, contracts and purchase orders. Each type of transaction document requires custom processing and analysis due to the diversity in language and structure of the document. Contracts typically require deep understanding of the content such as identifying sentence structures, identifying entities and relationships between them compared to receipts and invoices, which are somewhat semi-structured and require a different kind of processing. We elaborate on the challenges we have experienced and use of NLP in conjunction with a lightweight semantic layer to alleviate these challenges.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120959279","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}
引用次数: 0
Peer Reviewing Revisited: Assessing Research with Interlinked Semantic Comments 同行评议重访:用相互关联的语义评论评估研究
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364434
C. Bucur, Tobias Kuhn, D. Ceolin
{"title":"Peer Reviewing Revisited: Assessing Research with Interlinked Semantic Comments","authors":"C. Bucur, Tobias Kuhn, D. Ceolin","doi":"10.1145/3360901.3364434","DOIUrl":"https://doi.org/10.1145/3360901.3364434","url":null,"abstract":"Scientific publishing seems to be at a turning point. Its paradigm has stayed basically the same for 300 years but is now challenged by the increasing volume of articles that makes it very hard for scientists to stay up to date in their respective fields. In fact, many have pointed out serious flaws of current scientific publishing practices, including the lack of accuracy and efficiency of the reviewing process. To address some of these problems, we apply here the general principles of the Web and the Semantic Web to scientific publishing, focusing on the reviewing process. We want to determine if a fine-grained model of the scientific publishing workflow can help us make the reviewing processes better organized and more accurate, by ensuring that review comments are created with formal links and semantics from the start. Our contributions include a novel model called Linkflows that allows for such detailed and semantically rich representations of reviews and the reviewing processes. We evaluate our approach on a manually curated dataset from several recent Computer Science journals and conferences that come with open peer reviews. We gathered ground-truth data by contacting the original reviewers and asking them to categorize their own review comments according to our model. Comparing this ground truth to answers provided by model experts, peers, and automated techniques confirms that our approach of formally capturing the reviewers' intentions from the start prevents substantial discrepancies compared to when this information is later extracted from the plain-text comments. In general, our analysis shows that our model is well understood and easy to apply, and it revealed the semantic properties of such review comments.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129560313","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}
引用次数: 6
Knowledge Based Situation Discovery for Avionics Maintenance 基于知识的航电维护态势发现
Proceedings of the 10th International Conference on Knowledge Capture Pub Date : 2019-09-23 DOI: 10.1145/3360901.3364430
Luis Palacios Medinacelli, Yue Ma, C. Reynaud, G. Lortal
{"title":"Knowledge Based Situation Discovery for Avionics Maintenance","authors":"Luis Palacios Medinacelli, Yue Ma, C. Reynaud, G. Lortal","doi":"10.1145/3360901.3364430","DOIUrl":"https://doi.org/10.1145/3360901.3364430","url":null,"abstract":"For knowledge intensive domains, such as Avionics Maintenance, applying automated analysis comes with a major challenge: formalizing complex domain knowledge and conceiving suitable automated algorithms for real world requirements. In this paper, we propose a study on knowledge discovery to assist avionics maintenance via identifying meaningful Description Logic based complex concepts, called situation discovery, that corresponds to crucial scenarios during device repair. We propose an approach to automatic learning of relevant situations hidden in an ontology, in an unsupervised way. Distinct from ontology based concept learning, where a set of instances is given as positive examples of a target concept, the challenge of learning hidden situations consists in discovering significant situations from exponentially many unknown situations. In this paper we formalize the problem and study some related complexity results as well as the algorithms to solve the problem, together with its application to Avionics Maintenance. The approach has been integrated into an enterprise system and achieves the state-of-the-art result in this application.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121581561","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书