International Conference on Semantic Systems最新文献

筛选
英文 中文
Towards a Knowledge-Aware AI - SEMANTiCS 2022 - Proceedings of the 18th International Conference on Semantic Systems, 13-15 September 2022, Vienna, Austria 迈向知识感知AI - SEMANTiCS 2022 -第18届语义系统国际会议论文集,2022年9月13-15日,奥地利维也纳
International Conference on Semantic Systems Pub Date : 2022-09-06 DOI: 10.3233/ssw55
{"title":"Towards a Knowledge-Aware AI - SEMANTiCS 2022 - Proceedings of the 18th International Conference on Semantic Systems, 13-15 September 2022, Vienna, Austria","authors":"","doi":"10.3233/ssw55","DOIUrl":"https://doi.org/10.3233/ssw55","url":null,"abstract":"","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115489583","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
Automatically Drafting Ontologies from Competency Questions with FrODO 用FrODO自动从能力问题中起草本体
International Conference on Semantic Systems Pub Date : 2022-06-06 DOI: 10.3233/SSW220014
Aldo Gangemi, Anna Sofia Lippolis, Giorgia Lodi, Andrea Giovanni Nuzzolese
{"title":"Automatically Drafting Ontologies from Competency Questions with FrODO","authors":"Aldo Gangemi, Anna Sofia Lippolis, Giorgia Lodi, Andrea Giovanni Nuzzolese","doi":"10.3233/SSW220014","DOIUrl":"https://doi.org/10.3233/SSW220014","url":null,"abstract":"We present the Frame-based ontology Design Outlet (FrODO), a novel method and tool for drafting ontologies from competency questions automatically. Competency questions are expressed as natural language and are a common solution for representing requirements in a number of agile ontology engineering methodologies, such as the eXtreme Design (XD) or SAMOD. FrODO builds on top of FRED. In fact, it leverages the frame semantics for drawing domain-relevant boundaries around the RDF produced by FRED from a competency question, thus drafting domain ontologies. We carried out a user-based study for assessing FrODO in supporting engineers for ontology design tasks. The study shows that FrODO is effective in this and the resulting ontology drafts are qualitative.","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127341998","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
Further with Knowledge Graphs - Proceedings of the 17th International Conference on Semantic Systems, SEMANTiCS 2017, Amsterdam, The Netherlands, September 6-9, 2021 第十七届国际语义系统会议论文集,语义学2017,荷兰阿姆斯特丹,2021年9月6-9日
International Conference on Semantic Systems Pub Date : 2021-08-31 DOI: 10.3233/ssw53
{"title":"Further with Knowledge Graphs - Proceedings of the 17th International Conference on Semantic Systems, SEMANTiCS 2017, Amsterdam, The Netherlands, September 6-9, 2021","authors":"","doi":"10.3233/ssw53","DOIUrl":"https://doi.org/10.3233/ssw53","url":null,"abstract":"","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116909109","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
Embedding Taxonomical, Situational or Sequential Knowledge Graph Context for Recommendation Tasks 为推荐任务嵌入分类、情景或顺序知识图上下文
International Conference on Semantic Systems Pub Date : 2021-08-31 DOI: 10.3233/ssw210046
Simon Werner, Achim Rettinger, Lavdim Halilaj, Jürgen Lüttin
{"title":"Embedding Taxonomical, Situational or Sequential Knowledge Graph Context for Recommendation Tasks","authors":"Simon Werner, Achim Rettinger, Lavdim Halilaj, Jürgen Lüttin","doi":"10.3233/ssw210046","DOIUrl":"https://doi.org/10.3233/ssw210046","url":null,"abstract":"Learned latent vector representations are key to the success of many recommender systems in recent years. However, traditional approaches like matrix factorization produce vector representations that capture global distributions of a static recommendation scenario only. Such latent user or item representations do not capture background knowledge and are not customized to a concrete situational context and the sequential history of events leading up to it. This is a fundamentally limiting restriction for many tasks and applications, since the latent state can depend on a) abstract background information, b) the current situational context and c) the history of related observations. An illustrating example is a restaurant recommendation scenario, where a user’s assessment of the situation depends a) on taxonomical information regarding the type of cuisine, b) on situational factors like time of day, weather or location and c) on the subjective individual history and experience of this user in preceding situations. This situation-specific internal state of the user is not captured when using a traditional collaborative filtering approach, since background knowledge, the situational context and the sequential nature of an individual’s history cannot easily be represented in the matrix. In this paper, we investigate how well state-of-the-art approaches do exploit those different dimensions relevant to POI recommendation tasks. Naturally, we represent such a scenario as a temporal knowledge graph and compare plain knowledge graph, a taxonomy and a hypergraph embedding approach, as well as a recurrent neural network architecture to exploit the different context-dimensions of such rich information. Our empirical evidence indicates that the situational context is most crucial to the prediction performance, while the taxonomical and sequential information are harder to exploit. However, they still have their specific merits depending on the situation.","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122582268","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
Literal2Feature: An Automatic Scalable RDF Graph Feature Extractor 一个自动可伸缩的RDF图特征提取器
International Conference on Semantic Systems Pub Date : 2021-08-31 DOI: 10.3233/ssw210036
Farshad Bakhshandegan Moghaddam, C. Draschner, Jens Lehmann, Hajira Jabeen
{"title":"Literal2Feature: An Automatic Scalable RDF Graph Feature Extractor","authors":"Farshad Bakhshandegan Moghaddam, C. Draschner, Jens Lehmann, Hajira Jabeen","doi":"10.3233/ssw210036","DOIUrl":"https://doi.org/10.3233/ssw210036","url":null,"abstract":"The last decades have witnessed significant advancements in terms of data generation, management, and maintenance. This has resulted in vast amounts of data becoming available in a variety of forms and formats including RDF. As RDF data is represented as a graph structure, applying machine learning algorithms to extract valuable knowledge and insights from them is not straightforward, especially when the size of the data is enormous. Although Knowledge Graph Embedding models (KGEs) convert the RDF graphs to low-dimensional vector spaces, these vectors often lack the explainability. On the contrary, in this paper, we introduce a generic, distributed, and scalable software framework that is capable of transforming large RDF data into an explainable feature matrix. This matrix can be exploited in many standard machine learning algorithms. Our approach, by exploiting semantic web and big data technologies, is able to extract a variety of existing features by deep traversing a given large RDF graph. The proposed framework is open-source, well-documented, and fully integrated into the active community project Semantic Analytics Stack (SANSA). The experiments on real-world use cases disclose that the extracted features can be successfully used in machine learning tasks like classification and clustering.","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126419064","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}
引用次数: 8
A Fully Decentralized Triplestore Managed via the Ethereum Blockchain 通过以太坊区块链管理的完全分散的三重存储
International Conference on Semantic Systems Pub Date : 2021-08-31 DOI: 10.3233/ssw210044
Sina Mahmoodi
{"title":"A Fully Decentralized Triplestore Managed via the Ethereum Blockchain","authors":"Sina Mahmoodi","doi":"10.3233/ssw210044","DOIUrl":"https://doi.org/10.3233/ssw210044","url":null,"abstract":"The growing web of data warrants better data management strategies. Data silos are single points of failure and they face availability problems which lead to broken links. Furthermore the dynamic nature of some datasets increases the need for a versioning scheme. In this work, we propose a novel architecture for a linked open data infrastructure, built on open decentralized technologies. IPFS is used for storage and retrieval of data, and the public Ethereum blockchain is used for naming, versioning and storing metadata of datasets. We furthermore exploit two mechanisms for maintaining a collection of relevant, high-quality datasets in a distributed manner in which participants are incentivized. The platform is shown to have a low barrier to entry and censorship-resistance. It benefits from the fault-tolerance of its underlying technologies. Furthermore, we validate the approach by implementing our solution.","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133291440","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
Annotating Entities with Fine-Grained Types in Austrian Court Decisions 在奥地利法院判决中用细粒度类型注释实体
International Conference on Semantic Systems Pub Date : 2021-08-31 DOI: 10.3233/ssw210041
Artem Revenko, Anna Breit, V. Mireles, J. Moreno-Schneider, C. Sageder, Sotirios Karampatakis
{"title":"Annotating Entities with Fine-Grained Types in Austrian Court Decisions","authors":"Artem Revenko, Anna Breit, V. Mireles, J. Moreno-Schneider, C. Sageder, Sotirios Karampatakis","doi":"10.3233/ssw210041","DOIUrl":"https://doi.org/10.3233/ssw210041","url":null,"abstract":"The usage of Named Entity Recognition tools on domain-specific corpora is often hampered by insufficient training data. We investigate an approach to produce fine-grained named entity annotations of a large corpus of Austrian court decisions from a small manually annotated training data set. We apply a general purpose Named Entity Recognition model to produce annotations of common coarse-grained types. Next, a small sample of these annotations are manually inspected by domain experts to produce an initial fine-grained training data set. To efficiently use the small manually annotated data set we formulate the task of named entity typing as a binary classification task – for each originally annotated occurrence of an entity, and for each fine-grained type we verify if the entity belongs to it. For this purpose we train a transformer-based classifier. We randomly sample 547 predictions and evaluate them manually. The incorrect predictions are used to improve the performance of the classifier – the corrected annotations are added to the training set. The experiments show that re-training with even a very small number (5 or 10) of originally incorrect predictions can significantly improve the classifier performance. We finally train the classifier on all available data and re-annotate the whole data set.","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130834288","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
LLOD-Driven Bilingual Word Embeddings Rivaling Cross-Lingual Transformers in Quality of Life Concept Detection from French Online Health Communities llod驱动的双语词嵌入在法国在线健康社区的生活质量概念检测中与跨语言转换器相抗衡
International Conference on Semantic Systems Pub Date : 2021-08-31 DOI: 10.3233/ssw210037
Katharina Allgaier, S. Veríssimo, Sherry Tan, Matthias Orlikowski, Matthias Hartung
{"title":"LLOD-Driven Bilingual Word Embeddings Rivaling Cross-Lingual Transformers in Quality of Life Concept Detection from French Online Health Communities","authors":"Katharina Allgaier, S. Veríssimo, Sherry Tan, Matthias Orlikowski, Matthias Hartung","doi":"10.3233/ssw210037","DOIUrl":"https://doi.org/10.3233/ssw210037","url":null,"abstract":"We describe the use of Linguistic Linked Open Data (LLOD) to support a cross-lingual transfer framework for concept detection in online health communities. Our goal is to develop multilingual text analytics as an enabler for analyzing health-related quality of life (HRQoL) from self-reported patient narratives. The framework capitalizes on supervised cross-lingual projection methods, so that labeled training data for a source language are sufficient and are not needed for target languages. Cross-lingual supervision is provided by LLOD lexical resources to learn bilingual word embeddings that are simultaneously tuned to represent an inventory of HRQoL concepts based on the World Health Organization’s quality of life surveys (WHOQOL). We demonstrate that lexicon induction from LLOD resources is a powerful method that yields rich and informative lexical resources for the cross-lingual concept detection task which can outperform existing domain-specific lexica. Furthermore, in a comparative evaluation we find that our models based on bilingual word embeddings exhibit a high degree of complementarity with an approach that integrates machine translation and rule-based extraction algorithms. In a combined configuration, our models rival the performance of state-of-the-art cross-lingual transformers, despite being of considerably lower model complexity.","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115165166","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
Object-Action Association Extraction from Knowledge Graphs 从知识图谱中提取对象-动作关联
International Conference on Semantic Systems Pub Date : 2021-08-31 DOI: 10.3233/ssw210048
Alexandros Vassiliades, T. Patkos, Vasilis Efthymiou, Antonis Bikakis, Nick Bassiliades, D. Plexousakis
{"title":"Object-Action Association Extraction from Knowledge Graphs","authors":"Alexandros Vassiliades, T. Patkos, Vasilis Efthymiou, Antonis Bikakis, Nick Bassiliades, D. Plexousakis","doi":"10.3233/ssw210048","DOIUrl":"https://doi.org/10.3233/ssw210048","url":null,"abstract":"Infusing autonomous artificial systems with knowledge about the physical world they inhabit is of utmost importance and a long-lasting goal in Artificial Intelligence (AI) research. Training systems with relevant data is a common approach; yet, it is not always feasible to find the data needed, especially since a big portion of this knowledge is commonsense. In this paper, we propose a novel method for extracting and evaluating relations between objects and actions from knowledge graphs, such as ConceptNet and WordNet. We present a complete methodology of locating, enriching, evaluating, cleaning and exposing knowledge from such resources, taking into consideration semantic similarity methods. One important aspect of our method is the flexibility in deciding how to deal with the noise that exists in the data. We compare our method with typical approaches found in the relevant literature, such as methods that exploit the topology or the semantic information in a knowledge graph, and embeddings. We test the performance of these methods on the Something-Something Dataset.","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124670700","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
Adding Structure and Removing Duplicates in SPARQL Results with Nested Tables 在嵌套表的SPARQL结果中添加结构和删除重复项
International Conference on Semantic Systems Pub Date : 2021-08-31 DOI: 10.3233/ssw210047
S. Ferré
{"title":"Adding Structure and Removing Duplicates in SPARQL Results with Nested Tables","authors":"S. Ferré","doi":"10.3233/ssw210047","DOIUrl":"https://doi.org/10.3233/ssw210047","url":null,"abstract":"The results of a SPARQL query are generally presented as a table with one row per result, and one column per projected variable. This is an immediate consequence of the formal definition of SPARQL results as a sequence of mappings from variables to RDF terms. However, because of the flat structure of tables, some of the RDF graph structure is lost. This often leads to duplicates in the contents of the table, and difficulties to read and interpret results. We propose to use nested tables to improve the presentation of SPARQL results. A nested table is a table where cells may contain embedded tables instead of RDF terms, and so recursively. We introduce an automated procedure that lifts flat tables into nested tables, based on an analysis of the query. We have implemented the procedure on top of Sparklis, a guided query builder in natural language, in order to further improve the readability of its UI. It can as well be implemented on any SPARQL querying interface as it only depends on the query and its flat results. We illustrate our proposal in the domain of pharmacovigilance, and evaluate it on complex queries over Wikidata.","PeriodicalId":275036,"journal":{"name":"International Conference on Semantic Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122056482","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学术官方微信