Lattice for nested rough approximation

DOI10.1080/09720529.2017.1387391MaRDI QIDQ5069980zbMATH OpenOpenAlexFDO

Authors Sankar Kumar Roy, Dipankar Rana

Publication date 19 April 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2017.1387391

zbMATH Keywords

equivalence relationknowledge granulationlatticerough set

Mathematics Subject Classification ID

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

Cites work

• A certain conception of the calculus of rough sets
• scientific article; zbMATH DE number 4051618 (Why is no real title available?)
• scientific article; zbMATH DE number 68518 (Why is no real title available?)
• scientific article; zbMATH DE number 108581 (Why is no real title available?)
• scientific article; zbMATH DE number 3504320 (Why is no real title available?)
• scientific article; zbMATH DE number 591315 (Why is no real title available?)
• scientific article; zbMATH DE number 754433 (Why is no real title available?)
• scientific article; zbMATH DE number 754440 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• Information granulation and rough set approximation
• Rough classification
• Rough sets

Cited in

(2)

• Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
• Granular computing in zero-divisor graphs of \(\mathbb{Z}_n\)

This page was built for publication: Lattice for nested rough approximation

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