首页 > 最新文献

Journal of Web Semantics最新文献

英文 中文
A multiplatform reasoning engine for the Semantic Web of Everything 万物语义网的多平台推理引擎
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-07-01 DOI: 10.1016/j.websem.2022.100709
Michele Ruta, Floriano Scioscia, Ivano Bilenchi, Filippo Gramegna, Giuseppe Loseto, Saverio Ieva, Agnese Pinto

The Internet of Everything and Semantic Web can be joined by giving more intelligence to pervasive systems. To that end, reasoning capabilities should be enabled even for very resource-constrained embedded devices. This paper presents Tiny-ME (the Tiny Matchmaking Engine), a matchmaking and reasoning engine for the Web Ontology Language (OWL), designed and implemented with a compact and portable C core. Main features are high resource efficiency and multiplatform support, spanning containerized microservices, desktops, mobile devices, and embedded boards. The OWLlink interface has been extended to enable non-standard reasoning services for matchmaking in Web, Cloud, and Edge computing. A prototype evaluation is proposed, including a case study on the Pixhawk Unmanned Aerial Vehicle (UAV) autopilot and performance highlights.

万物互联(Internet of Everything)和语义网(Semantic Web)可以通过赋予普适性系统更多智能而结合在一起。为此,即使对于资源非常有限的嵌入式设备,也应该启用推理能力。本文介绍了一个基于Web本体语言(OWL)的匹配和推理引擎Tiny- me (the Tiny Matchmaking Engine),它是用一个紧凑的、可移植的C内核设计和实现的。主要特点是资源效率高,支持多平台,支持容器化微服务、桌面、移动设备和嵌入式板。OWLlink接口已经得到扩展,可以为Web、云和边缘计算中的配对提供非标准推理服务。提出了一种原型机评估方法,包括对Pixhawk无人机(UAV)自动驾驶仪的案例研究和性能亮点。
{"title":"A multiplatform reasoning engine for the Semantic Web of Everything","authors":"Michele Ruta,&nbsp;Floriano Scioscia,&nbsp;Ivano Bilenchi,&nbsp;Filippo Gramegna,&nbsp;Giuseppe Loseto,&nbsp;Saverio Ieva,&nbsp;Agnese Pinto","doi":"10.1016/j.websem.2022.100709","DOIUrl":"10.1016/j.websem.2022.100709","url":null,"abstract":"<div><p><span>The Internet of Everything<span> and Semantic Web can be joined by giving more intelligence to pervasive systems. To that end, reasoning capabilities should be enabled even for very resource-constrained embedded devices. This paper presents </span></span><em>Tiny-ME</em><span> (the Tiny Matchmaking Engine), a matchmaking and reasoning engine<span> for the Web Ontology Language<span><span> (OWL), designed and implemented with a compact and portable C core. Main features are high resource efficiency and multiplatform support, spanning containerized microservices, desktops, </span>mobile devices<span><span><span>, and embedded boards. The OWLlink interface has been extended to enable non-standard reasoning services for matchmaking in Web, Cloud, and </span>Edge computing. A </span>prototype evaluation is proposed, including a case study on the </span></span></span></span><em>Pixhawk</em><span> Unmanned Aerial Vehicle (UAV) autopilot and performance highlights.</span></p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74639827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A hybrid E-learning recommendation integrating adaptive profiling and sentiment analysis 集成自适应分析和情感分析的混合电子学习推荐
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100700
Hadi Ezaldeen , Rachita Misra , Sukant Kishoro Bisoy , Rawaa Alatrash , Rojalina Priyadarshini

This research proposes a novel framework named Enhanced e-Learning Hybrid Recommender System (ELHRS) that provides an appropriate e-content with the highest predicted ratings corresponding to the learner’s particular needs. To accomplish this, a new model is developed to deduce the Semantic Learner Profile automatically. It adaptively associates the learning patterns and rules depending on the learner’s behavior and the semantic relations computed in the semantic matrix that mutually links e-learning materials and terms. Here, a semantic-based approach for term expansion is introduced using DBpedia and WordNet ontologies. Further, various sentiment analysis models are proposed and incorporated as a part of the recommender system to predict ratings of e-learning resources from posted text reviews utilizing fine-grained sentiment classification on five discrete classes. Qualitative Natural Language Processing (NLP) methods with tailored-made Convolutional Neural Network (CNN) are developed and evaluated on our customized dataset collected for a specific domain and a public dataset. Two improved language models are introduced depending on Skip-Gram (S-G) and Continuous Bag of Words (CBOW) techniques. In addition, a robust language model based on hybridization of these couple of methods is developed to derive better vocabulary representation, yielding better accuracy 89.1% for the CNN-Three-Channel-Concatenation model. The suggested recommendation methodology depends on the learner’s preferences, other similar learners’ experience and background, deriving their opinions from the reviews towards the best learning resources. This assists the learners in finding the desired e-content at the proper time.

本研究提出了一种新的框架,即增强型电子学习混合推荐系统(Enhanced e-Learning Hybrid recommendation System, ELHRS),它提供了与学习者的特定需求相对应的具有最高预测评级的合适的电子内容。为了实现这一目标,开发了一个新的模型来自动推导语义学习者轮廓。它根据学习者的行为和在相互连接电子学习材料和术语的语义矩阵中计算的语义关系,自适应地关联学习模式和规则。本文介绍了使用DBpedia和WordNet本体进行术语扩展的一种基于语义的方法。此外,提出了各种情感分析模型,并将其作为推荐系统的一部分,利用五个离散类的细粒度情感分类,从发布的文本评论中预测电子学习资源的评级。在我们为特定领域和公共数据集收集的定制数据集上,开发并评估了定制卷积神经网络(CNN)的定性自然语言处理(NLP)方法。介绍了两种基于跳格(S-G)和连续词袋(CBOW)技术的改进语言模型。此外,基于这对方法的杂交开发了一个鲁棒的语言模型,以获得更好的词汇表示,cnn -三通道连接模型的准确率达到89.1%。建议的推荐方法取决于学习者的偏好,其他类似学习者的经验和背景,从对最佳学习资源的评论中得出他们的意见。这有助于学习者在适当的时间找到所需的电子内容。
{"title":"A hybrid E-learning recommendation integrating adaptive profiling and sentiment analysis","authors":"Hadi Ezaldeen ,&nbsp;Rachita Misra ,&nbsp;Sukant Kishoro Bisoy ,&nbsp;Rawaa Alatrash ,&nbsp;Rojalina Priyadarshini","doi":"10.1016/j.websem.2021.100700","DOIUrl":"10.1016/j.websem.2021.100700","url":null,"abstract":"<div><p><span>This research proposes a novel framework named Enhanced e-Learning Hybrid Recommender System (ELHRS) that provides an appropriate e-content with the highest predicted ratings corresponding to the learner’s particular needs. To accomplish this, a new model is developed to deduce the Semantic Learner Profile automatically. It adaptively associates the learning patterns and rules depending on the learner’s behavior and the semantic relations computed in the semantic matrix that mutually links e-learning materials and terms. Here, a semantic-based approach for term expansion is introduced using DBpedia and WordNet ontologies. Further, various </span>sentiment analysis<span><span> models are proposed and incorporated as a part of the recommender system<span><span> to predict ratings of e-learning resources from posted text reviews utilizing fine-grained sentiment classification on five discrete classes. Qualitative Natural Language Processing (NLP) methods with tailored-made </span>Convolutional Neural Network (CNN) are developed and evaluated on our customized dataset collected for a specific domain and a public dataset. Two improved </span></span>language models are introduced depending on Skip-Gram (S-G) and Continuous Bag of Words (CBOW) techniques. In addition, a robust language model based on hybridization of these couple of methods is developed to derive better vocabulary representation, yielding better accuracy 89.1% for the CNN-Three-Channel-Concatenation model. The suggested recommendation methodology depends on the learner’s preferences, other similar learners’ experience and background, deriving their opinions from the reviews towards the best learning resources. This assists the learners in finding the desired e-content at the proper time.</span></p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82902142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
An empirical study of representing adjectives over knowledge bases: Approach, lexicon and application 形容词知识库表示的实证研究:方法、词汇和应用
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100681
Jiwei Ding, Wei Hu, Xin Yu, Yuzhong Qu

Adjectives are common in natural language, and their usage and semantics have been studied broadly. In recent years, with the rapid growth of knowledge bases (KBs), many knowledge-based question answering (KBQA) systems are developed to answer users’ natural language questions over KBs. A fundamental task of such systems is to transform natural language questions into structural queries, e.g., SPARQL queries. Thus, such systems require knowledge about how natural language expressions are represented in KBs, including adjectives. In this paper, we specifically address the problem of representing adjectives over KBs. We propose a novel approach, called Adj2SP, to represent adjectives as SPARQL query patterns. Adj2SP contains a statistic-based approach and a neural network-based approach, both of them can effectively reduce the search space for adjective representations and overcome the lexical gap between input adjectives and their target representations. Two adjective representation datasets are built for evaluation, with adjectives used in QALD and Yahoo! Answers, as well as their representations over DBpedia. Experimental results show that Adj2SP can generate representations of high quality and significantly outperform several alternative approaches in F1-score. Furthermore, we publish Lark, a lexicon for adjective representations over KBs. Current KBQA systems show an improvement of over 24% in F1-score by integrating Adj2SP.

形容词在自然语言中很常见,人们对形容词的用法和语义进行了广泛的研究。近年来,随着知识库(KBs)的快速增长,许多基于知识的问答(KBQA)系统被开发出来,以回答用户在知识库上的自然语言问题。这种系统的一个基本任务是将自然语言问题转换为结构化查询,例如SPARQL查询。因此,这样的系统需要关于自然语言表达式如何在KBs中表示的知识,包括形容词。在本文中,我们专门解决了在KBs上表示形容词的问题。我们提出一种称为Adj2SP的新方法,将形容词表示为SPARQL查询模式。Adj2SP包含了一种基于统计的方法和一种基于神经网络的方法,这两种方法都可以有效地减少形容词表示的搜索空间,克服输入形容词与其目标表示之间的词汇差距。构建了两个形容词表示数据集用于评估,其中的形容词在QALD和Yahoo!答案,以及它们在DBpedia上的表示。实验结果表明,Adj2SP可以生成高质量的表示,并且在f1得分方面显著优于几种替代方法。此外,我们还发布了Lark,这是一个用于在KBs上表示形容词的词典。目前的KBQA系统通过集成Adj2SP, f1得分提高了24%以上。
{"title":"An empirical study of representing adjectives over knowledge bases: Approach, lexicon and application","authors":"Jiwei Ding,&nbsp;Wei Hu,&nbsp;Xin Yu,&nbsp;Yuzhong Qu","doi":"10.1016/j.websem.2021.100681","DOIUrl":"10.1016/j.websem.2021.100681","url":null,"abstract":"<div><p>Adjectives are common in natural language, and their usage and semantics have been studied broadly. In recent years, with the rapid growth of knowledge bases (KBs), many knowledge-based question answering (KBQA) systems are developed to answer users’ natural language questions over KBs. A fundamental task of such systems is to transform natural language questions into structural queries, e.g., SPARQL queries. Thus, such systems require knowledge about how natural language expressions are represented in KBs, including adjectives. In this paper, we specifically address the problem of representing adjectives over KBs. We propose a novel approach, called Adj2SP, to represent adjectives as SPARQL query patterns. Adj2SP contains a statistic-based approach and a neural network-based approach, both of them can effectively reduce the search space for adjective representations and overcome the lexical gap between input adjectives and their target representations. Two adjective representation datasets are built for evaluation, with adjectives used in QALD and Yahoo! Answers, as well as their representations over DBpedia. Experimental results show that Adj2SP can generate representations of high quality and significantly outperform several alternative approaches in F1-score. Furthermore, we publish Lark, a lexicon for adjective representations over KBs. Current KBQA systems show an improvement of over 24% in F1-score by integrating Adj2SP.</p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73837177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A study of the quality of Wikidata 维基数据质量的研究
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100679
Kartik Shenoy , Filip Ilievski , Daniel Garijo , Daniel Schwabe , Pedro Szekely

Wikidata has been increasingly adopted by many communities for a wide variety of applications, which demand high-quality knowledge to deliver successful results. In this paper, we develop a framework to detect and analyze low-quality statements in Wikidata by shedding light on the current practices exercised by the community. We explore three indicators of data quality in Wikidata, based on: (1) community consensus on the currently recorded knowledge, assuming that statements that have been removed and not added back are implicitly agreed to be of low quality; (2) statements that have been deprecated; and (3) constraint violations in the data. We combine these indicators to detect low-quality statements, revealing challenges with duplicate entities, missing triples, violated type rules, and taxonomic distinctions. Our findings complement ongoing efforts by the Wikidata community to improve data quality, aiming to make it easier for users and editors to find and correct mistakes.

维基数据已经被越来越多的社区采用,用于各种各样的应用程序,这些应用程序需要高质量的知识来交付成功的结果。在本文中,我们开发了一个框架,通过揭示社区当前的实践来检测和分析维基数据中的低质量声明。我们探索了维基数据中数据质量的三个指标,基于:(1)社区对当前记录的知识的共识,假设已删除且未添加的语句隐含地同意低质量;(二)已弃用的语句;(3)数据中的约束违反情况。我们结合这些指标来检测低质量语句,揭示具有重复实体、缺少三元组、违反类型规则和分类区别的挑战。我们的发现补充了维基数据社区为提高数据质量所做的持续努力,旨在让用户和编辑者更容易发现和纠正错误。
{"title":"A study of the quality of Wikidata","authors":"Kartik Shenoy ,&nbsp;Filip Ilievski ,&nbsp;Daniel Garijo ,&nbsp;Daniel Schwabe ,&nbsp;Pedro Szekely","doi":"10.1016/j.websem.2021.100679","DOIUrl":"10.1016/j.websem.2021.100679","url":null,"abstract":"<div><p>Wikidata has been increasingly adopted by many communities for a wide variety of applications, which demand high-quality knowledge to deliver successful results. In this paper, we develop a framework to detect and analyze low-quality statements in Wikidata by shedding light on the current practices exercised by the community. We explore three indicators of data quality in Wikidata, based on: (1) community consensus on the currently recorded knowledge, assuming that statements that have been removed and not added back are implicitly agreed to be of low quality; (2) statements that have been deprecated; and (3) constraint violations in the data. We combine these indicators to detect low-quality statements, revealing challenges with duplicate entities, missing triples, violated type rules, and taxonomic distinctions. Our findings complement ongoing efforts by the Wikidata community to improve data quality, aiming to make it easier for users and editors to find and correct mistakes.</p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89901650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
A framework for differentially-private knowledge graph embeddings 差分私有知识图嵌入框架
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100696
Xiaolin Han , Daniele Dell’Aglio , Tobias Grubenmann , Reynold Cheng , Abraham Bernstein

Knowledge graph (KG) embedding methods are at the basis of many KG-based data mining tasks, such as link prediction and node clustering. However, graphs may contain confidential information about people or organizations, which may be leaked via embeddings. Research recently studied how to apply differential privacy to a number of graphs (and KG) analyses, but embedding methods have not been considered so far. This study moves a step toward filling such a gap, by proposing the Differential Private Knowledge Graph Embedding (DPKGE) framework.

DPKGE extends existing KG embedding methods (e.g., TransE, TransM, RESCAL, and DistMult) and processes KGs containing both confidential and unrestricted statements. The resulting embeddings protect the presence of any of the former statements in the embedding space using differential privacy. Our experiments identify the cases where DPKGE produces useful embeddings, by analyzing the training process and tasks executed on top of the resulting embeddings.

知识图嵌入方法是许多基于知识图的数据挖掘任务的基础,如链接预测和节点聚类。然而,图形可能包含有关个人或组织的机密信息,这些信息可能通过嵌入泄露。最近的研究研究了如何将差分隐私应用于许多图(和KG)分析,但到目前为止还没有考虑嵌入方法。本研究通过提出差分私有知识图谱嵌入(DPKGE)框架,向填补这一空白迈出了一步。DPKGE扩展了现有的KG嵌入方法(例如,TransE, TransM, RESCAL和DistMult),并处理包含机密和无限制语句的KG。生成的嵌入使用差分隐私保护嵌入空间中任何前面语句的存在。我们的实验通过分析训练过程和在结果嵌入上执行的任务,确定了DPKGE产生有用嵌入的情况。
{"title":"A framework for differentially-private knowledge graph embeddings","authors":"Xiaolin Han ,&nbsp;Daniele Dell’Aglio ,&nbsp;Tobias Grubenmann ,&nbsp;Reynold Cheng ,&nbsp;Abraham Bernstein","doi":"10.1016/j.websem.2021.100696","DOIUrl":"10.1016/j.websem.2021.100696","url":null,"abstract":"<div><p>Knowledge graph (KG) embedding methods are at the basis of many KG-based data mining tasks<span><span>, such as link prediction and node clustering. However, graphs may contain confidential information about people or organizations, which may be leaked via embeddings. Research recently studied how to apply differential privacy to a number of graphs (and KG) analyses, but embedding methods have not been considered so far. This study moves a step toward filling such a gap, by proposing the Differential </span>Private Knowledge Graph Embedding (DPKGE) framework.</span></p><p>DPKGE extends existing KG embedding methods (e.g., TransE, TransM, RESCAL, and DistMult) and processes KGs containing both confidential and unrestricted statements. The resulting embeddings protect the presence of any of the former statements in the embedding space using differential privacy. Our experiments identify the cases where DPKGE produces useful embeddings, by analyzing the training process and tasks executed on top of the resulting embeddings.</p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81074247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
The Smart Musical Instruments Ontology 智能乐器本体
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100687
Luca Turchet , Paolo Bouquet , Andrea Molinari , György Fazekas

The Smart Musical Instruments (SMIs) are an emerging category of musical instruments that belongs to the wider class of Musical Things within the Internet of Musical Things paradigm. SMIs encompass sensors, actuators, embedded intelligence, and wireless connectivity to local networks and to the Internet. Interoperability represents a key issue within this domain, where heterogeneous SMIs are envisioned to exchange information between each other and a plethora of Musical Things. This paper proposes an ontology for the representation of the knowledge related to SMIs, with the aim of facilitating interoperability between SMIs as well as with other Musical Things interacting with them. There was no previous comprehensive data model for the SMIs domain, however the new ontology relates to existing ontologies, including the SOSA Ontology for the representation of sensors and actuators, the Audio Effects Ontology dealing with the description of digital audio effects, and the IoMusT Ontology for the representation Musical Things and IoMusT ecosystems. This paper documents the design of the ontology and its evaluation with respect to specific requirements gathered from an extensive literature review, which was based on scenarios involving SMIs stakeholders, such as performers and studio producers. The SMI Ontology can be accessed at: https://w3id.org/smi#.

智能乐器(SMIs)是一种新兴的乐器类别,属于音乐物联网范式下更广泛的音乐物类别。SMIs包括传感器、执行器、嵌入式智能以及到本地网络和互联网的无线连接。互操作性代表了这个领域中的一个关键问题,在这个领域中,异类的smi被设想为在彼此之间和大量的音乐事物之间交换信息。本文提出了一个本体来表示与smi相关的知识,目的是促进smi之间以及与之交互的其他音乐事物之间的互操作性。SMIs领域以前没有全面的数据模型,但是新的本体与现有的本体相关,包括用于表示传感器和执行器的SOSA本体,用于描述数字音频效果的音频效果本体,以及用于表示音乐事物和IoMusT生态系统的IoMusT本体。本文记录了本体的设计及其对从广泛的文献综述中收集的特定需求的评估,这些需求基于涉及SMIs利益相关者(如表演者和工作室制作人)的场景。SMI本体可以访问:https://w3id.org/smi#。
{"title":"The Smart Musical Instruments Ontology","authors":"Luca Turchet ,&nbsp;Paolo Bouquet ,&nbsp;Andrea Molinari ,&nbsp;György Fazekas","doi":"10.1016/j.websem.2021.100687","DOIUrl":"10.1016/j.websem.2021.100687","url":null,"abstract":"<div><p>The Smart Musical Instruments (SMIs) are an emerging category of musical instruments that belongs to the wider class of Musical Things within the Internet of Musical Things paradigm. SMIs encompass sensors, actuators, embedded intelligence, and wireless connectivity to local networks and to the Internet. Interoperability represents a key issue within this domain, where heterogeneous SMIs are envisioned to exchange information between each other and a plethora of Musical Things. This paper proposes an ontology for the representation of the knowledge related to SMIs, with the aim of facilitating interoperability between SMIs as well as with other Musical Things interacting with them. There was no previous comprehensive data model for the SMIs domain, however the new ontology relates to existing ontologies, including the SOSA Ontology for the representation of sensors and actuators, the Audio Effects Ontology dealing with the description of digital audio effects, and the IoMusT Ontology for the representation Musical Things and IoMusT ecosystems. This paper documents the design of the ontology and its evaluation with respect to specific requirements gathered from an extensive literature review, which was based on scenarios involving SMIs stakeholders, such as performers and studio producers. The SMI Ontology can be accessed at: <span>https://w3id.org/smi#</span><svg><path></path></svg>.</p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75247656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
A reference architecture for social robots 社交机器人的参考体系结构
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100683
Luigi Asprino , Paolo Ciancarini , Andrea Giovanni Nuzzolese , Valentina Presutti , Alessandro Russo

Social robotics poses tough challenges to software designers who are required to take care of difficult architectural drivers like acceptability, trust of robots as well as to guarantee that robots establish a personalized interaction with their users. Moreover, in this context recurrent software design issues such as ensuring interoperability, improving reusability and customizability of software components also arise. Designing and implementing social robotic software architectures is a time-intensive activity requiring multi-disciplinary expertise: this makes it difficult to rapidly develop, customize, and personalize robotic solutions. These challenges may be mitigated at design time by choosing certain architectural styles, implementing specific architectural patterns and using particular technologies. Leveraging on our experience in the MARIO project, in this paper we propose a series of principles that social robots may benefit from. These principles lay also the foundations for the design of a reference software architecture for social robots. The goal of this work is twofold: (i) Establishing a reference architecture whose components are unambiguously characterized by an ontology thus allowing to easily reuse them in order to implement and personalize social robots; (ii) Introducing a series of standardized software components for social robots architecture (mostly relying on ontologies and semantic technologies) to enhance interoperability, to improve explainability, and to favor rapid prototyping.

社交机器人技术对软件设计师提出了严峻的挑战,他们需要考虑复杂的架构驱动因素,如机器人的可接受性、信任度,以及保证机器人与用户建立个性化的交互。此外,在这种情况下,反复出现的软件设计问题,如确保互操作性、提高软件组件的可重用性和可定制性,也会出现。设计和实现社交机器人软件架构是一项耗时的活动,需要多学科的专业知识:这使得快速开发、定制和个性化机器人解决方案变得困难。在设计时,可以通过选择特定的体系结构风格、实现特定的体系结构模式和使用特定的技术来减轻这些挑战。利用我们在MARIO项目中的经验,我们在本文中提出了一系列社交机器人可能受益的原则。这些原则也为设计社交机器人的参考软件体系结构奠定了基础。这项工作的目标是双重的:(i)建立一个参考架构,其组件具有明确的本体特征,从而允许轻松地重用它们,以实现和个性化社交机器人;(ii)为社交机器人架构引入一系列标准化的软件组件(主要依赖于本体和语义技术),以增强互操作性,提高可解释性,并有利于快速原型。
{"title":"A reference architecture for social robots","authors":"Luigi Asprino ,&nbsp;Paolo Ciancarini ,&nbsp;Andrea Giovanni Nuzzolese ,&nbsp;Valentina Presutti ,&nbsp;Alessandro Russo","doi":"10.1016/j.websem.2021.100683","DOIUrl":"10.1016/j.websem.2021.100683","url":null,"abstract":"<div><p><span>Social robotics poses tough challenges to software designers who are required to take care of difficult architectural drivers like acceptability, trust of robots as well as to guarantee that robots establish a personalized interaction with their users. Moreover, in this context recurrent<span><span> software design issues such as ensuring interoperability, improving </span>reusability<span> and customizability of software components also arise. Designing and implementing social robotic software architectures is a time-intensive activity requiring multi-disciplinary expertise: this makes it difficult to rapidly develop, customize, and personalize robotic solutions. These challenges may be mitigated at design time by choosing certain architectural styles, implementing specific architectural patterns and using particular technologies. Leveraging on our experience in the MARIO project, in this paper we propose a series of principles that social robots may benefit from. These principles lay also the foundations for the design of a reference software architecture for social robots. The goal of this work is twofold: </span></span></span><em>(i)</em> Establishing a reference architecture whose components are unambiguously characterized by an ontology thus allowing to easily reuse them in order to implement and personalize social robots; <em>(ii)</em><span> Introducing a series of standardized software components for social robots architecture (mostly relying on ontologies and semantic technologies) to enhance interoperability, to improve explainability, and to favor rapid prototyping.</span></p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84635634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
NLIRE: A Natural Language Inference method for Relation Extraction 关系抽取的自然语言推理方法
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100686
Wenfei Hu , Lu Liu , Yupeng Sun , Yu Wu , Zhicheng Liu , Ruixin Zhang , Tao Peng

Relation extraction task aims at detecting the semantic relation between a pair of entities in a given target sentence. However, previous methods lack the description of the relation definition, thus needing to model the implication of relations during training. To tackle this issue, we propose a natural language inference method for relation extraction. Given a premise and a hypothesis, the natural language inference task refers to predicting whether the facts in the premise necessarily imply the facts in the hypothesis. Specifically, for each relation type, we construct a relation description. These relation descriptions are the definition of relation, containing prior knowledge that helps model understand the meaning of relation. The given target sentence is viewed as the premise, and these descriptions are viewed as the hypotheses. Then model infers whether these hypotheses can be concluded from the premise. Based on the inference results, our model selects the relation corresponding to the most confident hypothesis as the prediction. Substantial experiments on SemEval2010 Task8 dataset demonstrate that the proposed method achieves state-of-the-art performance.

关系抽取任务的目的是检测给定目标句子中一对实体之间的语义关系。然而,以往的方法缺乏对关系定义的描述,因此需要在训练过程中对关系的含义进行建模。为了解决这个问题,我们提出了一种自然语言推理的关系提取方法。给定前提和假设,自然语言推理任务是指预测前提中的事实是否必然暗示假设中的事实。具体来说,对于每个关系类型,我们构建一个关系描述。这些关系描述是关系的定义,包含了帮助模型理解关系含义的先验知识。给定的目标句被视为前提,这些描述被视为假设。然后模型推断这些假设是否可以从前提中得出结论。基于推理结果,我们的模型选择最可信假设对应的关系作为预测。在SemEval2010 Task8数据集上的大量实验表明,该方法达到了最先进的性能。
{"title":"NLIRE: A Natural Language Inference method for Relation Extraction","authors":"Wenfei Hu ,&nbsp;Lu Liu ,&nbsp;Yupeng Sun ,&nbsp;Yu Wu ,&nbsp;Zhicheng Liu ,&nbsp;Ruixin Zhang ,&nbsp;Tao Peng","doi":"10.1016/j.websem.2021.100686","DOIUrl":"10.1016/j.websem.2021.100686","url":null,"abstract":"<div><p>Relation extraction task aims at detecting the semantic relation between a pair of entities in a given target sentence. However, previous methods lack the description of the relation definition, thus needing to model the implication of relations during training. To tackle this issue, we propose a natural language inference method for relation extraction. Given a premise and a hypothesis, the natural language inference task refers to predicting whether the facts in the premise necessarily imply the facts in the hypothesis. Specifically, for each relation type, we construct a relation description. These relation descriptions are the definition of relation, containing prior knowledge that helps model understand the meaning of relation. The given target sentence is viewed as the premise, and these descriptions are viewed as the hypotheses. Then model infers whether these hypotheses can be concluded from the premise. Based on the inference results, our model selects the relation corresponding to the most confident hypothesis as the prediction. Substantial experiments on SemEval2010 Task8 dataset demonstrate that the proposed method achieves state-of-the-art performance.</p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81620919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A multiplatform energy-aware OWL reasoner benchmarking framework 一个多平台能量感知OWL推理基准测试框架
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100694
Floriano Scioscia, Ivano Bilenchi, Michele Ruta, Filippo Gramegna, Davide Loconte

Performance evaluation is increasingly relevant for Web Ontology Language (OWL) reasoners, due to the expanding availability of knowledge corpuses on the Web, the growing variety of applications, and the rise to prominence of mobile and pervasive computing. Motivated mainly by the difficulty of comparing reasoning engines in the Semantic Web of Things (SWoT), this paper introduces evOWLuator, a novel approach and a multiplatform framework devised to be both flexible and expandable. It features integration of traditional and mobile/embedded engines as well as ontology dataset management, reasoning test execution, and report generation. A case study consisting of an experimental setting for time, memory peak and energy footprint evaluation with eight reasoners and four different platforms allows showcasing usage and validating features and usability of the tool.

由于Web上知识语料库的可用性不断扩大,应用程序的种类不断增加,以及移动和普适计算的兴起,性能评估与Web本体语言(OWL)推理器的关系日益密切。主要是由于在语义物联网(SWoT)中比较推理引擎的困难,本文介绍了evOWLuator,这是一种新颖的方法和多平台框架,具有灵活性和可扩展性。它的特点是集成了传统和移动/嵌入式引擎,以及本体数据集管理、推理测试执行和报告生成。案例研究包括时间、内存峰值和能源足迹评估的实验设置,使用8个推理器和4个不同的平台,可以展示该工具的使用情况,并验证其功能和可用性。
{"title":"A multiplatform energy-aware OWL reasoner benchmarking framework","authors":"Floriano Scioscia,&nbsp;Ivano Bilenchi,&nbsp;Michele Ruta,&nbsp;Filippo Gramegna,&nbsp;Davide Loconte","doi":"10.1016/j.websem.2021.100694","DOIUrl":"10.1016/j.websem.2021.100694","url":null,"abstract":"<div><p><span>Performance evaluation is increasingly relevant for Web Ontology Language<span> (OWL) reasoners<span>, due to the expanding availability of knowledge corpuses on the Web, the growing variety of applications, and the rise to prominence of mobile and pervasive computing. Motivated mainly by the difficulty of comparing reasoning engines in the Semantic Web of Things (SWoT), this paper introduces </span></span></span><span>evOWLuator</span><span>, a novel approach and a multiplatform framework devised to be both flexible and expandable. It features integration of traditional and mobile/embedded engines as well as ontology dataset management, reasoning test execution, and report generation. A case study consisting of an experimental setting for time, memory peak and energy footprint evaluation with eight reasoners and four different platforms allows showcasing usage and validating features and usability of the tool.</span></p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83096238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Skeleton parsing for complex question answering over knowledge bases 基于知识库的复杂问题回答的骨架解析
IF 2.5 3区 计算机科学 Q1 Computer Science Pub Date : 2022-04-01 DOI: 10.1016/j.websem.2021.100698
Yawei Sun , Pengwei Li , Gong Cheng , Yuzhong Qu

Answering complex questions involving multiple relations over knowledge bases is a challenging task. Many previous works rely on dependency parsing. However, errors in dependency parsing would influence their performance, in particular for long complex questions. In this paper, we propose a novel skeleton grammar to represent the high-level structure of a complex question. This lightweight formalism and its BERT-based parsing algorithm help to improve the downstream dependency parsing. To show the effectiveness of skeleton, we develop two question answering approaches: skeleton-based semantic parsing (called SSP) and skeleton-based information retrieval (called SIR). In SSP, skeleton helps to improve structured query generation. In SIR, skeleton helps to improve path ranking. Experimental results show that, thanks to skeletons, our approaches achieve state-of-the-art results on three datasets: LC-QuAD 1.0, GraphQuestions, and ComplexWebQuestions 1.1.

回答涉及多个知识库关系的复杂问题是一项具有挑战性的任务。以前的许多工作都依赖于依赖项解析。但是,依赖项解析中的错误会影响它们的性能,特别是对于长而复杂的问题。在本文中,我们提出了一种新的框架语法来表示复杂问题的高级结构。这种轻量级形式及其基于bert的解析算法有助于改进下游依赖项解析。为了显示骨架的有效性,我们开发了两种问答方法:基于骨架的语义解析(SSP)和基于骨架的信息检索(SIR)。在SSP中,骨架有助于改进结构化查询的生成。在SIR中,骨架有助于提高路径排序。实验结果表明,由于骨架,我们的方法在三个数据集上取得了最先进的结果:LC-QuAD 1.0、GraphQuestions和ComplexWebQuestions 1.1。
{"title":"Skeleton parsing for complex question answering over knowledge bases","authors":"Yawei Sun ,&nbsp;Pengwei Li ,&nbsp;Gong Cheng ,&nbsp;Yuzhong Qu","doi":"10.1016/j.websem.2021.100698","DOIUrl":"10.1016/j.websem.2021.100698","url":null,"abstract":"<div><p><span>Answering complex questions involving multiple relations over knowledge bases is a challenging task. Many previous works rely on dependency parsing<span><span>. However, errors in dependency parsing would influence their performance, in particular for long complex questions. In this paper, we propose a novel </span>skeleton grammar to represent the high-level structure of a complex question. This lightweight formalism and its BERT-based parsing algorithm help to improve the downstream dependency parsing. To show the effectiveness of skeleton, we develop two question answering approaches: skeleton-based semantic parsing (called </span></span><span>SSP</span>) and skeleton-based information retrieval (called <span>SIR</span>). In <span>SSP</span><span>, skeleton helps to improve structured query generation. In </span><span>SIR</span>, skeleton helps to improve path ranking. Experimental results show that, thanks to skeletons, our approaches achieve state-of-the-art results on three datasets: LC-QuAD 1.0, GraphQuestions, and ComplexWebQuestions 1.1.</p></div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88822731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
期刊
Journal of Web Semantics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1