Attribute dependencies for data with grades I,

DOI10.1080/03081079.2016.1205711zbMATH Open1404.68158OpenAlexW1667412067MaRDI QIDQ2964405FDOQ2964405

Authors Radim Belohlavek, Vilem Vychodil 

Publication date 24 February 2017

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

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

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)

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.

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

Cites work

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

Cited in

(21)

• Fuzzy attribute logic over complete residuated lattices
• A calculus for containment of fuzzy attributes
• Graded LinClosure and Its Role in Relational Data Analysis
• Formal concept analysis approach to understand digital evidence relationships
• Automated prover for attribute dependencies in data with grades
• Impact Zadeh's theory to algebraic structures. Multi-adjoint algebras
• Computing sets of graded attribute implications with witnessed non-redundancy
• Closure structures parameterized by systems of isotone Galois connections
• On sets of graded attribute implications with witnessed non-redundancy
• Bimorphisms and attribute implications in heterogeneous formal contexts
• A new algorithm for Boolean matrix factorization which admits overcovering
• L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size
• Generating Fuzzy Attribute Rules Via Fuzzy Formal Concept Analysis
• A model for multigranular data and its integrity
• A reduction theorem to compute fixpoints of fuzzy closure operators
• Fuzzy inequational logic
• Attribute implications in \textbf{L}-concept analysis with positive and negative attributes: validity and properties of models
• Generalized quantifiers in formal concept analysis
• Constructing L-fuzzy concept lattices without fuzzy Galois closure operation
• A logic of graded attributes
• LinCbO: fast algorithm for computation of the Duquenne-Guigues basis

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)