A Rough Set Approach to Measuring Information Granules

  • Authors:
  • James F. Peters;Zdzislaw Pawlak;Andrzej Skowron

  • Affiliations:
  • -;-;-

  • Venue:
  • COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article introduces an approach to measures of information granules based on rough set theory. Informally, an information granule is a representation of a multiset (or bag) of real-world objects that are somehow indistinguishable (e.g., water samples taken from the same source at approximately the same time), or similar (e.g., various renditions of Chopin's sonatas or various series of very high, tinkling trills common in the songs of winter wrens), or which cause the same functionality (e.g., unmanned helicopters, line-crawling robots). Examples of measures of information granules based on rough set theory are inclusion, closeness, size, and enclosure. All of these measures are based on rough inclusion. This paper is limited to aconsideration of measures of inclusion based on a straightforward extension of classical rough membership functions and closeness based on measurement of separation of equivalence classes in a partition of the universe containing information granules. Measurement of sensor-based information granules has been motivated by recent studies of sensor signals. Asensor signal is a non-empty, finite set of sample sensor signal values temporally ordered.Classification of sensor signals requires measurements of sample signal values over subintervals of time. The contribution of this article is the introduction of a rough set approach to measuring information granule inclusion and closeness.