Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Urbani, Jacopo"'
Autor:
Bonte, Pieter, Calbimonte, Jean-Paul, de Leng, Daniel, Dell'Aglio, Daniele, Della Valle, Emanuele, Eiter, Thomas, Giannini, Federico, Heintz, Fredrik, Schekotihin, Konstantin, Le-Phuoc, Danh, Mileo, Alessandra, Schneider, Patrik, Tommasini, Riccardo, Urbani, Jacopo, Ziffer, Giacomo
Publikováno v:
Transactions on Graph Data and Knowledge, Vol 2, Iss 1, Pp 2:1-2:47 (2024)
In the last decade, there has been a growing interest in applying AI technologies to implement complex data analytics over data streams. To this end, researchers in various fields have been organising a yearly event called the "Stream Reasoning Works
Externí odkaz:
https://doaj.org/article/ca5022e45e6f4f768f95d001d8d52a93
The role of uncertainty in data management has become more prominent than ever before, especially because of the growing importance of machine learning-driven applications that produce large uncertain databases. A well-known approach to querying such
Externí odkaz:
http://arxiv.org/abs/2304.05459
We study reasoning with existential rules to perform query answering over streams of data. On static databases, this problem has been widely studied, but its extension to rapidly changing data has not yet been considered. To bridge this gap, we exten
Externí odkaz:
http://arxiv.org/abs/2205.02220
Autor:
Yang, Song, Urbani, Jacopo
We study the problem of performing automatic stance classification on social media with neural architectures such as BERT. Although these architectures deliver impressive results, their level is not yet comparable to the one of humans and they might
Externí odkaz:
http://arxiv.org/abs/2109.06508
Publikováno v:
International Semantic Web Conference 2020 Nov 2 (pp. 349-365)
Tables in scientific papers contain a wealth of valuable knowledge for the scientific enterprise. To help the many of us who frequently consult this type of knowledge, we present Tab2Know, a new end-to-end system to build a Knowledge Base (KB) from t
Externí odkaz:
http://arxiv.org/abs/2107.13306
The chase is a well-established family of algorithms used to materialize Knowledge Bases (KBs), like Knowledge Graphs (KGs), to tackle important tasks like query answering under dependencies or data cleaning. A general problem of chase algorithms is
Externí odkaz:
http://arxiv.org/abs/2102.02753
Autor:
Urbani, Jacopo, Jacobs, Ceriel
The increasing availability and usage of Knowledge Graphs (KGs) on the Web calls for scalable and general-purpose solutions to store this type of data structures. We propose Trident, a novel storage architecture for very large KGs on centralized syst
Externí odkaz:
http://arxiv.org/abs/2001.09078
Autor:
Carral, David, Urbani, Jacopo
The chase is a sound and complete algorithm for conjunctive query answering over ontologies of existential rules with equality. To enable its effective use, we can apply acyclicity notions; that is, sufficient conditions that guarantee chase terminat
Externí odkaz:
http://arxiv.org/abs/1911.10981
Materialisation is often used in RDF systems as a preprocessing step to derive all facts implied by given RDF triples and rules. Although widely used, materialisation considers all possible rule applications and can use a lot of memory for storing th
Externí odkaz:
http://arxiv.org/abs/1908.10177
We propose a new end-to-end method for extending a Knowledge Graph (KG) from tables. Existing techniques tend to interpret tables by focusing on information that is already in the KG, and therefore tend to extract many redundant facts. Our method aim
Externí odkaz:
http://arxiv.org/abs/1907.00083