Transformations and information granularity of knowledge structures in set-based granular computing

Abstract

Granular computing is a relatively new platform for constructing, describing and processing information or knowledge. For crisp information granulation, the universe is decomposed into granules by binary relations on the universe, say, preorder, tolerance and equivalence relations. A knowledge structure is composed of all information granules induced by a relation that corresponds to the granulation. This paper establishes a novel theoretical framework for the measurement of information granularity of knowledge structures. First, two new relations between knowledge structures are introduced through the use of their respective Boolean relation matrices, where the granular equality relation is defined based on an orthogonal transformation with the transformation matrix being a permutation matrix, and the granularly finer relation is presented by combining the classical finer relation and the orthogonal transformation. Then, it is demonstrated that the simplified knowledge structure base with the granularly finer relation is a partially ordered set, which can be represented by a Hasse diagram. Subsequently, an axiomatic definition of information granularity is proposed to satisfy the constraints regarding these two relations. Moreover, a general form of the information granularity is given, and some existing measures are proved to be its special cases. Finally, as an application of the proposed measure, the attribute significance measure is developed based on the information granularity.