Functional and approximate dependency mining: database and FCA points of view

Lopes, Stéphane; Petit, Jean-Marc; Lakhal, Lotfi

doi:10.1080/09528130210164143

Cited by 51 publications

(45 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The definition of a formal context to characterize the functional dependencies that hold in a dataset can be found in [1,18,15]. These dependencies are also characterized with pattern structures (a generalization of FCA) in [5].…”

Section: Previous Workmentioning

confidence: 99%

A Formal Context for Acyclic Join Dependencies

Baixeries

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Section: Previous Workmentioning

confidence: 99%

A Formal Context for Acyclic Join Dependencies

Baixeries

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The concept of agree set (as well as the associated closure system), introduced in Beeri et al (1984) to characterize the Armstrong relation, has been successfully used to discover exact and approximate functional dependencies (Lopes et al, 2002). Two tuples agree on an attribute set X if they share the same value on X.…”

Section: Agree Setsmentioning

confidence: 99%

“…The discovery of functional dependencies is a well known task in database design and tuning (Beeri et al, 1984;Lopes et al, 2002;Novelli and Cicchetti, 2001). All the approaches tackling this issue mine a canonical cover which encompasses all the minimal functional dependencies.…”

Section: Functional Dependenciesmentioning

confidence: 99%

“…Among such issues, let us quote the extraction of functional or approximate dependencies (Lopes et al, 2002), the computation and representation of data cubes (Casali et al, 2009a;Nedjar et al, 2009;Casali et al, 2003;Lakshmanan et al, 2002) and the multidimensional database analysis through the Skycube concept (Pei et al, 2006(Pei et al, , 2005Yuan et al, 2005). In this paper, we propose two well founded and generic structures which can be used to solve the given issues.…”

Section: Introductionmentioning

confidence: 99%

“…An agree set is a set of attributes for which certain tuples agree, i.e. share the same value (Beeri et al, 1984;Lopes et al, 2002). The agree sets and partitions are combined through a particular Galois connection in order to constitute Agree Concepts.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Agree Concept Lattice for Multidimensional Database Analysis

Nedjar

Pesci

Lakhal

et al. 2011

Formal Concept Analysis

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we propose the characterization of two new structures, the Agree Concept Lattice and the Quotient Agree Lattice of a database relation. Both of them are of great interest for multidimensional database analysis. They provide a formal framework which makes it possible to improve computation time, reduce representation and easily navigate through the Hasse diagram. These structures are generic, apply to various database analysis problems and combine formal concept analysis and database theory. They make use of the concepts of agree set and database partition. Agree set and partition are associated to define the Agree Concept of a database relation. The set of all the Agree Concepts is organized within the Agree Concept Lattice. The Quotient Agree Lattice is along the lines of both the Titanic framework and the quotient cube.We also briefly present three application fields of the proposed structures. The first two ones are classical since they concern on the one hand the discovery of functional and approximate dependencies for database design and tuning and on the other hand the data cube computation and representation. The latter field has been recently investigated. The underlying issue is to retrieve the most relevant objects according to the user expectations: the Skyline. The multidimensional generalization of the Skyline has been proposed through the Skycube. The proposed structures smartly solve the problem of partial materialization of Skycube with reconstruction guarantee.

show abstract