In this paper, we propose a new efficient algorithm called Dep-Miner for discovering minimal
non-trivial functional dependencies from large databases. Based on theoretical foundations …

Closure systems (ie families of subsets of a set S containing S and closed by set
intersection) or, equivalently, closure operators and full implicational systems appear in …

In this paper, we propose an efficient rule discovery algorithm, called FD_Mine, for mining
functional dependencies from data. By exploiting Armstrong's Axioms for functional …

Ordered sets are ubiquitous in mathematics and have significant applications in computer
science, statistics, biology and the social sciences. As the first book to deal exclusively with …

Linked data aims at publishing data expressed in RDF (Resource Description Framework) at
the scale of the worldwide web. These datasets interoperate by publishing links which …

A model of machine learning from positive and negative examples (JSM-learning) is
described in terms of Formal Concept Analysis (FCA). Graph-theoretical and lattice …

In this paper, we address the problem of the understandability and usefulness of the set of
discovered association rules. This problem is important since real-life databases lead most …

In this article, we deal with the functional and approximate dependency inference problem
by pointing out some relationships between relational database theory and formal concept …

Recently, Gottlob, Lee, Valiant, and Valiant (GLVV) presented an output size bound for join
queries with functional dependencies (FD), based on a linear program on polymatroids …

Database schema design is seen as to decide on formats for time-varying instances, on
rules for supporting inferences and on semantic constraints. Schema design aims at both …