(2018) Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms.
|
Text
fedora-mandros,boley,vreeken.pdf Download (367kB) | Preview |
Abstract
The reliable fraction of information is an attractive score for quantifying (functional) dependencies in high-dimensional data. In this paper, we systematically explore the algorithmic implications of using this measure for optimization. We show that the problem is NP-hard, which justifies the usage of worst-case exponential-time as well as heuristic search methods. We then substantially improve the practical performance for both optimization styles by deriving a novel admissible bounding function that has an unbounded potential for additional pruning over the previously proposed one. Finally, we empirically investigate the approximation ratio of the greedy algorithm and show that it produces highly competitive results in a fraction of time needed for complete branch-and-bound style search.
| Item Type: | Conference or Workshop Item (A Paper) (Paper) |
|---|---|
| Divisions: | Jilles Vreeken (Exploratory Data Analysis) |
| Conference: | ICDM IEEE International Conference on Data Mining |
| Depositing User: | Sebastian Dalleiger |
| Date Deposited: | 07 Jun 2019 06:58 |
| Last Modified: | 10 May 2021 11:37 |
| Primary Research Area: | NRA5: Empirical & Behavioral Security |
| URI: | https://publications.cispa.saarland/id/eprint/2909 |
Actions
Actions (login required)
 |
View Item |