Approximations from anywhere and general rough sets

From MaRDI portal
Publication:5082166

DOI10.1007/978-3-319-60840-2_1zbMATH Open1489.68291arXiv1704.05443OpenAlexW2608910750MaRDI QIDQ5082166FDOQ5082166


Authors:


Publication date: 15 June 2022

Published in: Rough Sets (Search for Journal in Brave)

Abstract: Not all approximations arise from information systems. The problem of fitting approximations, subjected to some rules (and related data), to information systems in a rough scheme of things is known as the emph{inverse problem}. The inverse problem is more general than the duality (or abstract representation) problems and was introduced by the present author in her earlier papers. From the practical perspective, a few (as opposed to one) theoretical frameworks may be suitable for formulating the problem itself. emph{Granular operator spaces} have been recently introduced and investigated by the present author in her recent work in the context of antichain based and dialectical semantics for general rough sets. The nature of the inverse problem is examined from number-theoretic and combinatorial perspectives in a higher order variant of granular operator spaces and some necessary conditions are proved. The results and the novel approach would be useful in a number of unsupervised and semi supervised learning contexts and algorithms.


Full work available at URL: https://arxiv.org/abs/1704.05443




Recommendations





Cited In (4)





This page was built for publication: Approximations from anywhere and general rough sets

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