Information Granule Decomposition

Issue title: Concurrency Specification and Programming (CS&P'2000)

Article type: Research Article

Authors: Skowron, Andrzej | Stepaniuk, Jaroslaw

Affiliations: Institute of Mathematics, University of Warsaw, ul. Banacha 2, 02-097 Warszawa, Poland | Institute of Computer Science, Białystok University of Technology, Wiejska 45A, 15-351 Białystok, Poland

Abstract: Information sources provide us with granules of information that must be transformed, analyzed and built into structures that support problem solving. One of the main goals of information granule calculi is to develop algorithmic methods for construction of complex information granules from elementary ones by means of available operations and inclusion (closeness) measures. These constructed complex granules represent a form of information fusion. Such granules should satisfy some constraints like quality criteria or/and degrees of granule inclusion in (closeness to) a given information granule. Information granule decomposition methods are important components of those methods. We discuss some information granule decomposition methods.

Keywords: rough set theory, information granulation, granular computing, information fusion, decomposition, pattern, schemes of approximate reasoning

Journal: Fundamenta Informaticae, vol. 47, no. 3-4, pp. 337-350, 2001