Data Quality and Explainable AI

Autor: Floris Geerts, Leopoldo Bertossi

Publikováno v: ACM journal of data and information quality

In this work, we provide some insights and develop some ideas, with few technical details, about the role of explanations in Data Quality in the context of data-based machine learning models (ML). In this direction, there are, as expected, roles for

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f70e7924d9b3b2c559036106ef0a4df
https://doi.org/10.1145/3386687

Expressiveness and approximation properties of graph neural networks

Autor: Floris Geerts, Juan Reutter

Publikováno v: The Tenth International Conference on Learning Representations (ICLR 2022), 25 April 2022 (online event)
University of Antwerp

Characterizing the separation power of graph neural networks (GNNs) provides an understanding of their limitations for graph learning tasks. Results regarding separation power are, however, usually geared at specific GNNs architectures, and tools for

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::72df87bf99c2d736e9f7f2fc2fcd69c7
https://repository.uantwerpen.be/docstore/d:irua:16099

Matrix query languages

Autor: Thomas Muñoz, Domagoj Vrgoč, Floris Geerts, Jan Van den Bussche, Cristian Riveros

Publikováno v: ACM SIGMOD record

Due to the importance of linear algebra and matrix operations in data analytics, there has been a renewed interest in developing query languages that combine both standard relational operations and linear algebra operations. We survey aspects of the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27b21ff82c285bb26992c1b81340dbc6
https://hdl.handle.net/10067/1847790151162165141

Cleaning data with forbidden itemsets

Autor: Joeri Rammelaere, Floris Geerts

Publikováno v: IEEE transactions on knowledge and data engineering

Methods for cleaning dirty data typically employ additional information about the data such as user-provided constraints specifying when data is dirty, e.g., domain restrictions, illegal value combinations, or logical rules. However, real-world scena

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ccc923c8f91d357360582bdf365a13b
https://hdl.handle.net/10067/1706200151162165141

Bounded Query Rewriting Using Views

Autor: Floris Geerts, Wenfei Fan, Yang Cao, Ping Lu

Publikováno v: Cao, Y, Fan, W, Geerts, F & Lu, P 2018, ' Bounded Query Rewriting Using Views ', ACM Transactions on Database Systems, vol. 43, no. 1, 6 . https://doi.org/10.1145/3183673
Cao, Y, Fan, W, Geerts, F & Lu, P 2016, Bounded Query Rewriting Using Views . in PODS '16 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems . pp. 107-119, 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, San Francisco, United States, 26/06/16 . https://doi.org/10.1145/2902251.2902294
PODS '16 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, June 26-July 01, 2016, San Francisco, California, USA
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems-PODS '16
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems-PODS 16
PODS
ACM transactions on database systems
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
ACM Transactions on Database Systems

A query Q in a language L has a bounded rewriting using a set of L-definable views if there exists a query Q ′ in L such that given any dataset D , Q ( D ) can be computed by Q ′ that accesses only cached views and a small fraction D Q of D . We

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cee49c7a7a1f17150850742bf0dc1214
https://doi.org/10.1145/3183673