Redirigiendo al acceso original de articulo en 21 segundos...
Inicio  /  Algorithms  /  Vol: 13 Par: 4 (2020)  /  Artículo
ARTÍCULO
TITULO

About Granular Rough Computing?Overview of Decision System Approximation Techniques and Future Perspectives

Piotr Artiemjew    

Resumen

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.

 Artículos similares

       
 
Marta Vignola, David Werner, Matthew J. Wade, Paola Meynet, Russell J. Davenport     Pág. 499 - 508
Little is known about the forces that determine the assembly of diverse bacterial communities inhabiting drinking water treatment filters and how this affects drinking water quality. Two contrasting ecological theories can help to understand how natural ... ver más
Revista: Water Research

 
Sauro Manenti, Andrea Amicarelli and Sara Todeschini    
This work illustrated an application of the FOSS code SPHERA v.8.0 (RSE SpA, Milano, Italy) to the simulation of landslide hazard at the slope of a water basin. SPHERA is based on the weakly compressible SPH method (WCSPH) and holds a mixture model, cons... ver más
Revista: Water

 
Sung-Wook Jeen    
Arsenic (As) can be naturally present in the native aquifer materials and can be released to groundwater through reduction dissolution of iron oxides containing As. While granular iron permeable reactive barriers (PRBs) can be effective for the treatment... ver más
Revista: Water

 
Carlos Hidalgo Signes, Pablo Martínez Fernández, Julio Garzón-Roca, María Elvira Garrido de la Torre, Ricardo Insa Franco     Pág. 384 - 391
Over the last years rubber from scrap tyres has been reused in different civil works such as road embankments and railway platforms due to its resilient properties, low degradation and vibration attenuation. Unfortunately, this issue is still scarce. For... ver más