Attribute dependencies for data with grades I,

DOI10.1080/03081079.2016.1205711zbMATH Open1404.68158arXiv1402.2071OpenAlexW1667412067MaRDI QIDQ2964405FDOQ2964405

Authors: Radim Belohlavek, Vilem Vychodil 

Publication date: 24 February 2017

Published in: International Journal of General Systems (Search for Journal in Brave)

Abstract: This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or fuzzy, attributes instead of Boolean attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact match in case of functional dependencies. In a sense, we move from bivalence, inherently present in the now-available theories of dependencies, to a more flexible setting that involves grades. Such a shift has far-reaching consequences. We argue that a reasonable theory of dependencies may be developed by making use of mathematical fuzzy logic. Namely, the theory of dependencies is then based on a solid logic calculus the same way the classical dependencies are based on classical logic. For instance, rather than handling degrees of similarity in an ad hoc manner, we consistently treat them as truth values, the same way as true (match) and false (mismatch) are treated in classical theories. In addition, several notions intuitively embraced in the presence of grades, such as a degree of validity of a particular dependence or a degree of entailment, naturally emerge and receive a conceptually clean treatment in the presented approach. In the paper, we discuss motivations, provide basic notions of syntax and semantics, and develop basic results which include entailment of dependencies, associated closure structures, a logic of dependencies with two versions of completeness theorem, results and algorithms regarding complete non-redundant sets of dependencies, relationship to and a possible reductionist interface to classical dependencies, and relationship to functional dependencies over domains with similarity.

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

Recommendations

• Automated prover for attribute dependencies in data with grades
• Knowledge discovery in data sets with graded attributes
• BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
• scientific article; zbMATH DE number 3932435
• Publication:4933966
• Graded LinClosure and Its Role in Relational Data Analysis
• On rough dependency of attributes in information systems
• Triadic concept lattices of data with graded attributes
• Implications and dependencies between attributes

zbMATH Keywords

gradesimilarityredundancyfuzzy logicfunctional dependenceattribute dependence

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy logic; logic of vagueness (03B52) Database theory (68P15)

Cites Work

• Concept lattices and order in fuzzy logic
• On Fuzzy Logic I Many‐valued rules of inference
• A treatise on many-valued logics
• Title not available (Why is that?)
• A relational model of data for large shared data banks
• L-fuzzy sets
• Fuzzy Galois Connections
• Residuated lattices. An algebraic glimpse at substructural logics
• Is there a need for fuzzy logic?
• Formal concept analysis and linguistic hedges
• Mathematical Fuzzy Logics
• Fuzzy Closure Operators with Truth Stressers
• Handbook of mathematical fuzzy logic. Volume 2
• Functional Dependencies in a Relational Database and Propositional Logic
• Fuzzy algorithms
• Decomposition of a Data Base and the Theory of Boolean Switching Functions
• What is mathematical fuzzy logic
• Globalization of intuitionistic set theory
• On very true
• The GUHA method and its meaning for data mining
• Combining fuzzy information from multiple systems
• A logic of graded attributes

Cited In (19)

• A new algorithm for Boolean matrix factorization which admits overcovering
• Fuzzy inequational logic
• Title not available (Why is that?)
• Computing sets of graded attribute implications with witnessed non-redundancy
• On sets of graded attribute implications with witnessed non-redundancy
• L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size
• Graded LinClosure and Its Role in Relational Data Analysis
• A reduction theorem to compute fixpoints of fuzzy closure operators
• A calculus for containment of fuzzy attributes
• Generating Fuzzy Attribute Rules Via Fuzzy Formal Concept Analysis
• Bimorphisms and attribute implications in heterogeneous formal contexts
• Constructing L-fuzzy concept lattices without fuzzy Galois closure operation
• LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
• A logic of graded attributes
• Fuzzy attribute logic over complete residuated lattices
• Closure structures parameterized by systems of isotone Galois connections
• Attribute implications in \textbf{L}-concept analysis with positive and negative attributes: validity and properties of models
• Formal concept analysis approach to understand digital evidence relationships
• Generalized quantifiers in formal concept analysis

This page was built for publication: Attribute dependencies for data with grades I^,

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