Graded LinClosure and Its Role in Relational Data Analysis

DOI10.1007/978-3-540-78921-5_9MaRDI QIDQ5452420zbMATH OpenOpenAlexFDO

Authors Radim Belohlavek, Vilem Vychodil

Publication date 4 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78921-5_9

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
• Computing sets of graded attribute implications with witnessed non-redundancy
• Attribute dependencies for data with grades I^,
• On minimal sets of graded attribute implications
• On sets of graded attribute implications with witnessed non-redundancy

Cites work

• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 1183717 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 978992 (Why is no real title available?)
• scientific article; zbMATH DE number 2168560 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• scientific article; zbMATH DE number 2199279 (Why is no real title available?)
• AI 2005: Advances in Artificial Intelligence
• Formal Concept Analysis
• Fuzzy Closure Operators with Truth Stressers
• Fuzzy attribute logic over complete residuated lattices
• Fuzzy equational logic
• Globalization of intuitionistic set theory
• Metamathematics of fuzzy logic
• On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
• On very true
• The logic of inexact concepts

Cited in

(5)

• Attribute dependencies for data with grades I^,
• Possibility-theoretic extension of derivation operators in formal concept analysis over fuzzy lattices
• LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
• BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
• Formal concept analysis approach to understand digital evidence relationships

This page was built for publication: Graded LinClosure and Its Role in Relational Data Analysis

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