On Extension of Dependency and Consistency Degrees of Two Knowledges Represented by Covering

DOI10.1007/978-3-540-89876-4_19MaRDI QIDQ5505451zbMATH OpenOpenAlexFDO

Authors Pulak Samanta, Mihir K. Chakraborty

Publication date 27 January 2009

Published in Transactions on Rough Sets IX (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89876-4_19

zbMATH Keywords

rough setsconsistency degreeelementary categorydependency degreepartition and covering of knowledge

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)

Recommendations

• On relative reduction of knowledges in covering decision systems
• Rough dependencies of attributes in knowledge representation system
• Knowledge filter and its dependent reasoning discovery
• Knowledge spaces and reduction of covering approximation spaces
• Information interpretation of knowledge granularity

Cites work

• scientific article; zbMATH DE number 5129599 (Why is no real title available?)
• scientific article; zbMATH DE number 3932435 (Why is no real title available?)
• scientific article; zbMATH DE number 1183717 (Why is no real title available?)
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 68512 (Why is no real title available?)
• scientific article; zbMATH DE number 927110 (Why is no real title available?)
• Granular sets -- foundations and case study of tolerance spaces
• Rough sets
• Transactions on Rough Sets I
• Transactions on Rough Sets I
• Transactions on Rough Sets II

Cited in

(7)

• Consistency of incomplete data
• The rough membership functions on four types of covering-based rough sets and their applications
• Towards Logics of Some Rough Perspectives of Knowledge
• The rough membership function based on \(\overline{C_{10}}\) and its applications
• Generalized rough sets and implication lattices
• Knowledge filter and its dependent reasoning discovery
• \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality

This page was built for publication: On Extension of Dependency and Consistency Degrees of Two Knowledges Represented by Covering

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