Recently, there has been a renovated interest in functional dependencies due to the
possibility of employing them in several advanced database operations, such as data …

Pattern structures, an extension of FCA to data with complex descriptions, propose an
alternative to conceptual scaling (binarization) by giving direct way to knowledge discovery …

Pattern structures propose a direct way to knowledge discovery in data with structure, such
as logical formulas, graphs, strings, tuples of numerical intervals, etc., by defining closed …

Functional dependencies provide valuable knowledge on the relations between the
attributes of a data table. To extend their use, generalizations have been proposed, among …

Functional dependencies (FDs) provide valuable knowledge on the relations between
attributes of a data table. A functional dependency holds when the values of an attribute can …

Order and lattice theory provides convenient mathematical tools for pattern mining, in
particular for condensed irredundant representations of pattern spaces and their efficient …

Functional Dependencies (FDs) play a key role in many fields of the relational database
model, one of the most widely used database systems. FDs have also been applied in data …

This is an account of the characterization of database dependencies with Formal Concept
Analysis. Subjects: Databases (cs. DB); Logic in Computer Science (cs. LO) MSC classes …

Constraints, in a broad sense, are restrictions that exist (or should exist) in a dataset. There
are many different kinds of constraints, that differ not only in their semantics, but also, in the …

Symbolic classifiers allow for solving classification task and provide the reason for the
classifier decision. Such classifiers were studied by a large number of researchers and …