Sciweavers

61 search results - page 9 / 13
» Mining Violations to Relax Relational Database Constraints
Sort
View
PSD
2010
Springer
109views Database» more  PSD 2010»
14 years 10 months ago
A Tool for Analyzing and Fixing Infeasible RCTA Instances
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
Jordi Castro, José A. González
ICDT
2003
ACM
202views Database» more  ICDT 2003»
15 years 4 months ago
Condensed Representation of Database Repairs for Consistent Query Answering
Abstract. Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the ...
Jef Wijsen
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 3 days ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 3 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
ICDE
2007
IEEE
179views Database» more  ICDE 2007»
15 years 6 months ago
A New ILP-based Concept Discovery Method for Business Intelligence
In this work, we propose a multi-relational concept discovery method for business intelligence applications. Multi-relational data mining finds interesting patterns that span ove...
Seda Daglar Toprak, Pinar Senkul, Yusuf Kavurucu, ...