Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Livshits, Ester"'
Datasets often contain values that naturally reside in a metric space: numbers, strings, geographical locations, machine-learned embeddings in a Euclidean space, and so on. We study the computational complexity of repairing inconsistent databases tha
Externí odkaz:
http://arxiv.org/abs/2409.16713
Publikováno v:
SIGMOD Rec. 52(2): 6-17 (2023)
Attribution scores can be applied in data management to quantify the contribution of individual items to conclusions from the data, as part of the explanation of what led to these conclusions. In Artificial Intelligence, Machine Learning, and Data Ma
Externí odkaz:
http://arxiv.org/abs/2401.06234
Operational consistent query answering (CQA) is a recent framework for CQA based on revised definitions of repairs, which are built by applying a sequence of operations (e.g., fact deletions) starting from an inconsistent database until we reach a da
Externí odkaz:
http://arxiv.org/abs/2312.08038
Explaining why a database query result is obtained is an essential task towards the goal of Explainable AI, especially nowadays where expressive database query languages such as Datalog play a critical role in the development of ontology-based applic
Externí odkaz:
http://arxiv.org/abs/2303.12773
Operational consistent query answering (CQA) is a recent framework for CQA, based on revised definitions of repairs and consistent answers, which opens up the possibility of efficient approximations with explicit error guarantees. The main idea is to
Externí odkaz:
http://arxiv.org/abs/2204.10592
A key task in the context of consistent query answering is to count the number of repairs that entail the query, with the ultimate goal being a precise data complexity classification. This has been achieved in the case of primary keys and self-join-f
Externí odkaz:
http://arxiv.org/abs/2112.09617
A common interpretation of soft constraints penalizes the database for every violation of every constraint, where the penalty is the cost (weight) of the constraint. A computational challenge is that of finding an optimal subset: a collection of data
Externí odkaz:
http://arxiv.org/abs/2009.13821
Autor:
Livshits, Ester, Kimelfeld, Benny
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 2 (June 15, 2022) lmcs:8618
Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data cleaning. Another goal is to attribute to individual tuples a level of responsibility to the o
Externí odkaz:
http://arxiv.org/abs/2009.13819
The problem of mining integrity constraints from data has been extensively studied over the past two decades for commonly used types of constraints including the classic Functional Dependencies (FDs) and the more general Denial Constraints (DCs). In
Externí odkaz:
http://arxiv.org/abs/2005.08540
The Shapley value is a conventional and well-studied function for determining the contribution of a player to the coalition in a cooperative game. Among its applications in a plethora of domains, it has recently been proposed to use the Shapley value
Externí odkaz:
http://arxiv.org/abs/1912.12610