Information Granule Decomposition

Authors:
Andrzej Skowron;Jaroslaw Stepaniuk
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
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Year:
2001

Citing 9
Cited 2

Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Tolerance approximation spaces

Fundamenta Informaticae - Special issue: rough sets
Knowledge discovery by application of rough set models

Rough set methods and applications
Layered Learning in Multiagent Systems: A Winning Approach to Robotic Soccer

Layered Learning in Multiagent Systems: A Winning Approach to Robotic Soccer
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Advances in Distributed and Parallel Knowledge Discovery

Advances in Distributed and Parallel Knowledge Discovery
Qualitative Spatial Reasoning: Theory and Practice: Application to Robot Navigation

Qualitative Spatial Reasoning: Theory and Practice: Application to Robot Navigation
Decomposition of Task Specification Problems

ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Fuzzy logic = computing with words

IEEE Transactions on Fuzzy Systems

Toward Intelligent Systems: Calculi of Information Granules

Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
Approximate Reasoning by Agents

CEEMAS '01 Revised Papers from the Second International Workshop of Central and Eastern Europe on Multi-Agent Systems: From Theory to Practice in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

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.