Characterizing functional dependencies in formal concept analysis with pattern structures

DOI10.1007/s10472-014-9400-3zbMath1320.68064MaRDI QIDQ2254619

Mehdi Kaytoue, Amedeo Napoli, Jaume Baixeries

Publication date: 5 February 2015

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01101107/file/jb%2Bmk%2Ban-amai72-2014.pdf

zbMATH Keywords

formal concept analysis; association rules; data dependencies; attribute implications; pattern structures

Mathematics Subject Classification ID

68P15: Database theory

68T30: Knowledge representation

06A15: Galois correspondences, closure operators (in relation to ordered sets)

Related Items

Computing Dependencies Using FCA, Discovery of link keys in resource description framework datasets based on pattern structures, Graph-FCA meets pattern structures, On the connection of hypergraph theory with formal concept analysis and rough set theory, Characterizing approximate-matching dependencies in formal concept analysis with pattern structures, Rule extraction based on linguistic-valued intuitionistic fuzzy layered concept lattice, Link key candidate extraction with relational concept analysis, Enumerating all maximal biclusters in numerical datasets, The granular partition lattice of an information table, Logic of temporal attribute implications, A Formal Context for Acyclic Join Dependencies

Uses Software

• FastFDs
• TANE
• LCM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Impurity measures in databases
• Machine learning on the basis of formal concept analysis
• Constraint-generating dependencies
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Computing premises of a minimal cover of functional dependencies is intractable
• The Agree Concept Lattice for Multidimensional Database Analysis
• Formal Systems for Tuple and Equality Generating Dependencies
• Conditional Functional Dependencies: An FCA Point of View
• A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules
• On the Structure of Armstrong Relations for Functional Dependencies
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
• Why can concept lattices support knowledge discovery in databases?
• Functional and approximate dependency mining: database and FCA points of view
• Comparing performance of algorithms for generating concept lattices
• Formal Concept Analysis
• Concept Lattices