Interactive error correction in implicative theories

DOI10.1016/J.IJAR.2015.06.004MaRDI QIDQ899138zbMATH OpenOpenAlexFDO

Authors Sergei O. Kuznetsov, Artem Revenko

Publication date 21 December 2015

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.5215

zbMATH Keywords

formal concept analysiserror correctionclosure systemimplicative theory

Mathematics Subject Classification ID

Knowledge representation (68T30)

Abstract: Errors in implicative theories coming from binary data are studied. First, two classes of errors that may affect implicative theories are singled out. Two approaches for finding errors of these classes are proposed, both of them based on methods of Formal Concept Analysis. The first approach uses the cardinality minimal (canonical or Duquenne-Guigues) implication base. The construction of such a base is computationally intractable. Using an alternative approach one checks possible errors on the fly in polynomial time via computing closures of subsets of attributes. Both approaches are interactive, based on questions about the validity of certain implications. Results of computer experiments are presented and discussed.

Recommendations

• Exploring faulty data
• scientific article; zbMATH DE number 61569
• scientific article; zbMATH DE number 2140440
• scientific article; zbMATH DE number 2033323
• An algorithm for learning from erroneous and incorrigible examples

Cites work

• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1522651 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• Attribute-incremental construction of the canonical implication basis
• Automatized construction of implicative theory of algebraic identities of size up to 5
• Computing premises of a minimal cover of functional dependencies is intractable
• Concept Lattices
• Generalizations of Boolean algebras. An attribute exploration
• Mathematical classification and clustering
• On the complexity of enumerating pseudo-intents
• On the intractability of computing the Duquenne-Guigues base
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• The Description Logic Handbook
• Two basic algorithms in concept analysis
• Usability Issues in Description Logic Knowledge Base Completion

Cited in

(3)

• Concept lattices with negative information: a characterization theorem
• A new kind of implication to reason with unknown information
• Exploring faulty data

Describes a project that uses

Uses Software

• fca
• UCI

This page was built for publication: Interactive error correction in implicative theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899138)