About Granular Rough Computing—Overview of Decision System Approximation Techniques and Future Perspectives
Granular computing techniques are a huge discipline in which the basic component is to operate on groups of similar objects according to a fixed similarity measure. The first references to the granular computing can be seen in the works of Zadeh in fuzzy set theory. Granular computing allows for a v...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-03-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/13/4/79 |
| _version_ | 1797626377072017408 |
|---|---|
| author | Piotr Artiemjew |
| author_facet | Piotr Artiemjew |
| author_sort | Piotr Artiemjew |
| collection | DOAJ |
| description | Granular computing techniques are a huge discipline in which the basic component is to operate on groups of similar objects according to a fixed similarity measure. The first references to the granular computing can be seen in the works of Zadeh in fuzzy set theory. Granular computing allows for a very natural modelling of the world. It is very likely that the human brain, while solving problems, performs granular calculations on data collected from the senses. The researchers of this paradigm have proven the unlimited possibilities of granular computing. Among other things, they are used in the processes of classification, regression, missing values handling, for feature selection, and as mechanisms of data approximation. It is impossible to quote all methods based on granular computing—we can only discuss a selected group of techniques. In the article, we have presented a review of recently developed granulation techniques belonging to the family of approximation algorithms founded by Polkowski—in the framework of rough set theory. Starting from the basic Polkowski’s standard granulation, we have described further developed by us concept dependent, layered, and epsilon variants, and our recent homogeneous granulation. We are presenting simple numerical examples and samples of research results. The effectiveness of these methods in terms of decision system size reduction and maintenance of the internal knowledge from the original data are presented. The reduction in the number of objects in our techniques while maintaining classification efficiency reaches 90 percent—for standard granulation with usage of a kNN classifier (we achieve similar efficiency for the concept-dependent technique for the Naive Bayes classifier). The largest reduction achieved in the number of exhaustive set of rules at the efficiency level to the original data are 99 percent—it is for concept-dependent granulation. In homogeneous variants, the reduction is less than 60 percent, but the advantage of these techniques is that it is not necessary to look for optimal granulation parameters, which are selected dynamically. We also describe potential directions of development of granular computing techniques by prism of described methods. |
| first_indexed | 2024-03-11T10:09:33Z |
| format | Article |
| id | doaj.art-125d946a3a7846c7a5983edddef88521 |
| institution | Directory Open Access Journal |
| issn | 1999-4893 |
| language | English |
| last_indexed | 2024-03-11T10:09:33Z |
| publishDate | 2020-03-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Algorithms |
| spelling | doaj.art-125d946a3a7846c7a5983edddef885212023-11-16T14:34:24ZengMDPI AGAlgorithms1999-48932020-03-011347910.3390/a13040079About Granular Rough Computing—Overview of Decision System Approximation Techniques and Future PerspectivesPiotr Artiemjew0Faculty of Mathematics and Computer Science, University of Warmia and Mazury in Olsztyn, 10-710 Olsztyn, PolandGranular computing techniques are a huge discipline in which the basic component is to operate on groups of similar objects according to a fixed similarity measure. The first references to the granular computing can be seen in the works of Zadeh in fuzzy set theory. Granular computing allows for a very natural modelling of the world. It is very likely that the human brain, while solving problems, performs granular calculations on data collected from the senses. The researchers of this paradigm have proven the unlimited possibilities of granular computing. Among other things, they are used in the processes of classification, regression, missing values handling, for feature selection, and as mechanisms of data approximation. It is impossible to quote all methods based on granular computing—we can only discuss a selected group of techniques. In the article, we have presented a review of recently developed granulation techniques belonging to the family of approximation algorithms founded by Polkowski—in the framework of rough set theory. Starting from the basic Polkowski’s standard granulation, we have described further developed by us concept dependent, layered, and epsilon variants, and our recent homogeneous granulation. We are presenting simple numerical examples and samples of research results. The effectiveness of these methods in terms of decision system size reduction and maintenance of the internal knowledge from the original data are presented. The reduction in the number of objects in our techniques while maintaining classification efficiency reaches 90 percent—for standard granulation with usage of a kNN classifier (we achieve similar efficiency for the concept-dependent technique for the Naive Bayes classifier). The largest reduction achieved in the number of exhaustive set of rules at the efficiency level to the original data are 99 percent—it is for concept-dependent granulation. In homogeneous variants, the reduction is less than 60 percent, but the advantage of these techniques is that it is not necessary to look for optimal granulation parameters, which are selected dynamically. We also describe potential directions of development of granular computing techniques by prism of described methods.https://www.mdpi.com/1999-4893/13/4/79rough setsgranular rough computinggranulation techniquesclassification |
| spellingShingle | Piotr Artiemjew About Granular Rough Computing—Overview of Decision System Approximation Techniques and Future Perspectives Algorithms rough sets granular rough computing granulation techniques classification |
| title | About Granular Rough Computing—Overview of Decision System Approximation Techniques and Future Perspectives |
| title_full | About Granular Rough Computing—Overview of Decision System Approximation Techniques and Future Perspectives |
| title_fullStr | About Granular Rough Computing—Overview of Decision System Approximation Techniques and Future Perspectives |
| title_full_unstemmed | About Granular Rough Computing—Overview of Decision System Approximation Techniques and Future Perspectives |
| title_short | About Granular Rough Computing—Overview of Decision System Approximation Techniques and Future Perspectives |
| title_sort | about granular rough computing overview of decision system approximation techniques and future perspectives |
| topic | rough sets granular rough computing granulation techniques classification |
| url | https://www.mdpi.com/1999-4893/13/4/79 |
| work_keys_str_mv | AT piotrartiemjew aboutgranularroughcomputingoverviewofdecisionsystemapproximationtechniquesandfutureperspectives |