A Comparison of Pawlak’s and Skowron–Stepaniuk’s Approximation of Concepts

DOI10.1007/978-3-540-71200-8_5MaRDI QIDQ3591002zbMATH OpenOpenAlexFDO

Authors Anna Gomolińska

Publication date 3 September 2007

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-71200-8_5

Mathematics Subject Classification ID

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

Recommendations

• Concept approximation in mathematics and computer science. An essay in homage to Zdzisław Pawlak
• Comparing rough approximation of formal concept
• Approximations in concept lattices
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• scientific article; zbMATH DE number 1699994
• scientific article; zbMATH DE number 4185084
• Generalizations of Approximable Concept Lattice
• On Ruspini’s Models of Similarity-Based Approximate Reasoning

Cited in

(1)

• Rough Approximation Based on Weak q-RIFs

This page was built for publication: A Comparison of Pawlak’s and Skowron–Stepaniuk’s Approximation of Concepts

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