Database repair meets algorithmic fairness
Fairness is increasingly recognized as a critical component of machine learning systems.
However, it is the underlying data on which these systems are trained that often reflect …
However, it is the underlying data on which these systems are trained that often reflect …
Revisiting analogical proportions and analogical inference
M Bounhas, H Prade - International Journal of Approximate Reasoning, 2024 - Elsevier
In this paper, we consider analogical proportions which are statements of the form “a→ is to
b→ as c→ is to d→”, understood as a comparative formulation between vectors of items …
b→ as c→ is to d→”, understood as a comparative formulation between vectors of items …
Data dependencies extended for variety and veracity: A family tree
Besides the conventional schema-oriented tasks, data dependencies are recently revisited
for data quality applications, such as violation detection, data repairing and record matching …
for data quality applications, such as violation detection, data repairing and record matching …
Towards the efficient discovery of meaningful functional dependencies
We propose the first framework for discovering the set of meaningful functional
dependencies from data. This set contains the true positives among the set of functional …
dependencies from data. This set contains the true positives among the set of functional …
Applications of information inequalities to database theory problems
D Suciu - 2023 38th Annual ACM/IEEE Symposium on Logic in …, 2023 - ieeexplore.ieee.org
The paper describes several applications of information inequalities to problems in
database theory. The problems discussed include: upper bounds of a query's output, worst …
database theory. The problems discussed include: upper bounds of a query's output, worst …
Approximate order dependency discovery
Y **, Z Tan, W Zeng, S Ma - 2021 IEEE 37th International …, 2021 - ieeexplore.ieee.org
Lexicographical order dependencies (ODs) specify orders between list of attributes, and are
proven useful in optimizing SQL queries with order by clauses. To find hidden ODs from dirty …
proven useful in optimizing SQL queries with order by clauses. To find hidden ODs from dirty …
Discovery of approximate lexicographical order dependencies
Y **, Z Tan, J Chen, S Ma - IEEE Transactions on Knowledge …, 2021 - ieeexplore.ieee.org
Lexicographical order dependencies (LODs) specify orders between list of attributes, and
are proven useful in optimizing SQL queries with order by clauses. To discover hidden …
are proven useful in optimizing SQL queries with order by clauses. To discover hidden …
Boosting Meaningful Dependency Mining with Clustering and Covariance Analysis
X Wang, R **, W Huang, Y Tang - 2024 IEEE 40th …, 2024 - ieeexplore.ieee.org
Functional dependencies (FDs) form a valuable ingredient for various data management
tasks. However, existing methods can hardly discover practical and interpretable FDs …
tasks. However, existing methods can hardly discover practical and interpretable FDs …
Approximate Implication for Probabilistic Graphical Models
B Kenig - Journal of Artificial Intelligence Research, 2025 - jair.org
The graphical structure of Probabilistic Graphical Models (PGMs) represents the conditional
independence (CI) relations that hold in the modeled distribution. Every separator in the …
independence (CI) relations that hold in the modeled distribution. Every separator in the …
Enumeration of Minimal Hitting Sets Parameterized by Treewidth
B Kenig, DS Mizrahi - arxiv preprint arxiv:2408.15776, 2024 - arxiv.org
Enumerating the minimal hitting sets of a hypergraph is a problem which arises in many data
management applications that include constraint mining, discovering unique column …
management applications that include constraint mining, discovering unique column …