Computing Dependencies Using FCA

DOI10.1007/978-3-030-93278-7_6OpenAlexW4293114321MaRDI QIDQ5054980

Victor Codocedo, Amedeo Napoli, Mehdi Kaytoue, Jaume Baixeries

Publication date: 12 December 2022

Published in: Complex Data Analytics with Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-93278-7_6

zbMATH Keywords

constraintsknowledge discoveryFCA

Mathematics Subject Classification ID

Knowledge representation (68T30) Computational aspects of data analysis and big data (68T09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data cleaning and query answering with matching dependencies and matching functions
• Machine learning on the basis of formal concept analysis
• Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
• Constraint-generating dependencies
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Mining relaxed functional dependencies from data
• Characterizing functional dependencies in formal concept analysis with pattern structures
• A Formal Context for Acyclic Join Dependencies
• Conditional Functional Dependencies: An FCA Point of View
• Why can concept lattices support knowledge discovery in databases?
• Functional and approximate dependency mining: database and FCA points of view
• A Formal Context for Symmetric Dependencies
• Formal Concept Analysis