Granular computing: A rough set approach

We discuss information granule calculi as a basis of granular computing. Th ey are defined by constructs like information granules, basic relations of inclusion and closeness between information granules as well as operations on them. The exact interpretation between granule languages of different in formation sources (agents) often does not exist. Hence (rough) inclusion an d closeness of granules are considered instead of their equality. Examples of all the basic constructs of information granule calculi are presented. T he construction of more complex information granules is described by expres sions called terms. We discuss the synthesis problem of robust terms, i.e., descriptions of information granules, satisfying a given specification in a satisfactory degree. We also present a method for synthesis of informatio n granules represented by robust terms (approximate schemes of reasoning) b y means of decomposition of specifications for such granules. The discussed problems of granular computing are of special importance for many applicat ions, in particular related to spatial reasoning as well as to knowledge di scovery and data mining.