New Approach in Defining Rough Approximations

DOI10.1007/978-3-642-21563-6_7zbMath1305.68167OpenAlexW2179003966MaRDI QIDQ3019857

E. K. R. Nagarajan, D. Umadevi

Publication date: 29 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-21563-6_7

zbMATH Keywords

complete ortholatticerough approximationslinearly ordered setcomplete atomic Boolean latticealgebraic completely distributive lattice

Mathematics Subject Classification ID

Complete distributivity (06D10) Knowledge representation (68T30) Complete lattices, completions (06B23) Structure and representation theory of distributive lattices (06D05)

Cites Work

• A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
• Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
• Some methods for generating topologies by relations
• Constructive and algebraic methods of the theory of rough sets
• Two views of the theory of rough sets in finite universes
• Relational interpretations of neighborhood operators and rough set approximation operators
• Rough sets. Mathematical foundations
• Generalized rough sets based on relations
• Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
• Rough sets
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Some Methodological Remarks About Categorical Equivalences in the Abstract Approach to Roughness – Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New Approach in Defining Rough Approximations