Conditional functional dependencies: An FCA point of view

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Conditional Functional Dependencies (CFDs) are Functional Dependencies (FDs) that hold on a fragment relation of the original relation. In [17], the hierarchy between CFDs, association rules and some other dependencies have been shown. This paper exhibits the relation between CFDs and FCA. Given a many-valued relation we define a labeled lattice which gives a synthetic representation of the hierarchy of dependencies. Moreover, a formal concept in the nominal scaling of the relation is an instance of a closed set in the labeled lattice. Pure CFDs correspond to edges in this labeled lattice. We exhibit a monotone function on CFDs allowing search and pruning strategies. We also show that transitive edges induce redundant CFDs. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Medina, R., & Nourine, L. (2010). Conditional functional dependencies: An FCA point of view. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5986 LNAI, pp. 161–176). https://doi.org/10.1007/978-3-642-11928-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free