No confident code implementation found for this paper.
Rough sets (RS)proved a thriving realm with successes inn many fields of ML and AI. In this note, we expand RS to RM - rough mereology which provides a measurable degree of uncertainty to those areas.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Rough Randomness and its Application
Generalizing Machine Learning Evaluation through the Integration of Shannon Entropy and Rough Set Theory
Enhancement of Approximation Spaces by the Use of Primals and Neighborhood
On rough mereology and VC-dimension in treatment of decision prediction for open world decision systems
Lecture notes on rough paths and applications to machine learning
Algebraic Models for Qualified Aggregation in General Rough Sets, and Reasoning Bias Discovery
@article{polkowski2024machine,
title = {Machine Learning via rough mereology},
author = {Lech T. Polkowski},
year = {2024},
eprint = {2410.11579},
archivePrefix = {arXiv},
url = {http://arxiv.org/abs/2410.11579v1}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2410.11579)