The Traveling Analyst Problem: Definition and preliminary study
Résumé
This paper introduces the Traveling Analyst Problem (TAP), an original strongly NP-hard problem where an automated algorithm assists an analyst to explore a dataset, by suggesting the most interesting and coherent set of queries that are estimated to be completed under a time constraint. We motivate the problem, study its complexity, propose a simple heuristic under simplifying assumptions for approximating it, and run preliminary tests to observe the behavior of this heuristic.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...