Granular worlds: Representation and communication problems
β Scribed by Witold Pedrycz; George Vukovich
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 175 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
β¦ Synopsis
In this study, we introduce a concept of granular worlds and elaborate on various representation and communication issues arising therein. A granular world embodies a collection of information granules being regarded as generic conceptual entities used to represent knowledge and handle problem solving. Granular computing is a paradigm supporting knowledge representation, coping with complexity, and facilitating interpretation of processing. In this sense, it is crucial to all man-machine pursuits and data mining and intelligent data analysis, in particular. There are two essential facets that are inherently associated with any granular world, that is a formalism used to describe and Ε½ manipulate information granules and the granularity of the granules themselves roughly speaking, by the granularity we mean a ''size'' of such information granules; its detailed . definition depends upon the formal setting of the granular world . There are numerous Ε½ formal models of granular worlds ranging from set-theoretic developments including . Ε½ sets, fuzzy sets, and rough sets to probabilistic counterparts random sets, random . Ε½ variables and alike . In light of the evident diversity of granular world occurring both in . terms of the underlying formal settings as well as levels of granularity , we elaborate on their possible interaction and identify implications of such communication. More specifically, we have cast these in the form of the interoperability problem that is associated with the representation of information granules.
π SIMILAR VOLUMES
This paper describes the computer algorithms used in a numerical simulation of the compression of an aggregate of crushable grains. It has been used in a model for the evolution of a granular medium under one-dimensional compression, in which the probability of fracture for individual particles is a
A special case of combinatorial search, the recognition problem is examined in this article. (H; A; f) is a recognition problem if H is a set, A is a set system on H and f : H β {0; 1} is a function. Someone chooses an arbitrary x β H and instead of determining x itself (which is the case in most of