Characterizing covers of functional dependencies using FCA
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/123063
Tipus de documentText en actes de congrés
Data publicació2018
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Functional dependencies (FDs) can be used for various important operations
on data, for instance, checking the consistency and the quality of a
database (including databases that contain complex data). Consequently, a generic framework that allows mining a sound, complete, non-redundant and yet compact set of FDs is an important tool for many different applications. There are different definitions of such sets of FDs (usually called cover).
In this paper, we present the characterization of two different kinds of covers for FDs in terms of pattern structures. The convenience of such a characterization is that it allows an easy implementation of efficient mining algorithms which can later be easily adapted to other kinds of similar dependencies. Finally, we present empirical evidence that the proposed approach can perform better than state-ofthe-art FD miner algorithms in large databases.
CitacióCodocedo, V., Baixeries, J., Kaytoue, M., Napoli, A. Characterizing covers of functional dependencies using FCA. A: International Conference on Concept Lattices and Their Applications. "CEUR Workshop Proceedings". 2018, p. 279-290.
ISBN1613-0073
Versió de l'editorhttp://ceur-ws.org/Vol-2123/paper23.pdf
Altres identificadorshttps://hal.archives-ouvertes.fr/hal-01856516/document
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
paper23.pdf | 726,6Kb | Visualitza/Obre |