Regranulation: A granular algorithm enabling communication between granular worlds |
| |
Authors: | Scott Dick Adam Schenker Abraham Kandel |
| |
Affiliation: | a Department of Electrical and Computer Engineering, University of Alberta, 2nd Floor ECERF Building, Edmonton, AB, Canada T6G 2V4 b Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA |
| |
Abstract: | In this paper, we describe a granular algorithm for translating information between two granular worlds, represented as fuzzy rulebases. These granular worlds are defined on the same universe of discourse, but employ different granulations of this universe. In order to translate information from one granular world to the other, we must regranulate the information so that it matches the information granularity of the target world. This is accomplished through the use of a first-order interpolation algorithm, implemented using linguistic arithmetic, a set of elementary granular computing operations. We first demonstrate this algorithm by studying the common “fuzzy-PD” rulebase at several different granularities, and conclude that the “3 × 3” granulation may be too coarse for this objective. We then examine the question of what the “natural” granularity of a system might be; this is studied through a 10-fold cross-validation experiment involving three different granulations of the same underlying mapping. For the problem under consideration, we find that a 7 × 7 granulation appears to be the minimum necessary precision. |
| |
Keywords: | Fuzzy systems Granular computing Granular worlds Granular algorithms |
本文献已被 ScienceDirect 等数据库收录! |
|