A covering model of granular computing

Published 1 January 2005

Jian-Min Ma, Wen‐Xiu Zhang, Tong-Jun Li

DOI10.1109/icmlc.2005.1527205

Citations9

TL;DR

This paper is mainly to study a covering model of granular computing in a set-theoretic setting based on the assumption that a finite set of universe is granulated through a family of overlapping granules based on a reflexive relation.

Abstract

This paper is mainly to study a covering model of granular computing in a set-theoretic setting. The model is based on the assumption that a finite set of universe is granulated through a family of overlapping granules based on a reflexive relation. Two operations, called zooming-in and zooming-out operations, are used to study connections between the elements of a universe and the elements of a granulated universe, as well as connections between computations in the two universes.

Keywords

Computer Science

International Journal of Parallel ProgrammingRough sets

12,138 Citations1982Zdzis aw Pawlak

The presented approach may be considered as an alternative to fuzzy sets theory and tolerance theory and some applications are outlined.

International Journal of General SystemsROUGH FUZZY SETS AND FUZZY ROUGH SETS*

2,948 Citations1990Didier Dubois, Henri Prade

It is argued that both notions of a rough set and a fuzzy set aim to different purposes, and it is more natural to try to combine the two models of uncertainty (vagueness and coarseness) rather than to have them compete on the same problems.

Fuzzy Sets and SystemsToward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic

2,875 Citations1997Lotfi A. Zadeh

M Modes of information granulation (IG) in which the granules are crisp (c-granular) play important roles in a wide variety of methods, approaches and techniques, but this does not reflect the fact that in almost all of human reasoning and concept formation thegranules are fuzzy (f- Granular).

Granular Computing: basic issues and possible solutions

324 Citations2007Yiyu Yao

A set-theoretic model of GrC is proposed based on the notion of power algebras, with emphasis on the construction of granules and computation with granules.

Lecture notes in computer scienceA Partition Model of Granular Computing

317 Citations2004Yiyu Yao

This chapter examines the basic principles and issues of granular computing from semantic and algorithmic perspectives, as well as principles and operations of computing and reasoning with granules in a set-theoretic setting.

International Journal of Intelligent SystemsInformation granules: Towards foundations of granular computing

230 Citations2000Andrzej Skowron, Jarosław Stepaniuk

This work discusses a problem of synthesis of robust terms, i.e., descriptions of information granules, satisfying a given specification, an important problem for granular computing and its applications for spatial reasoning or knowledge discovery and data mining.

Lecture notes in computer scienceThe Quotient Space Theory of Problem Solving

143 Citations2007Ling Zhang, Bo Zhang

A framework of quotient space theory of problem solving, in which a problem (or problem space) is represented as a triplet, including the universe, its structure and attributes, is introduced.

Lecture notes in computer scienceInduction of Classification Rules by Granular Computing

110 Citations2002JingTao Yao, Yiyu Yao

For the design of granule selection heuristics, several measures on granules are suggested and a classification rule induction method is proposed that leads to finding a covering of the universe, which is more general than partition based methods.

Lecture notes in computer scienceGranular Computing

61 Citations2007Tsau Young Lin

Lecture notes in computer scienceApproximations and Rough Sets Based on Tolerances

61 Citations2001Jouni Järinen

This work investigates the structure of R-rough sets, studying R-approximations, R-definable sets, and R-equalities, and investigates the relationship between these sets and each other.