Title :
Granulation with Indistinguishability, Equivalence, or Similarity
Author_Institution :
Free Univ. of Bozen-Bolzano, Bolzano
Abstract :
One of the relations used with granularity is indistinguishability, where distinguishable entities in a finer-grained granule are indistinguishable in a coarser-grained granule. This relation is a subtype of equivalence relation, which is used in the other direction to create finer-grained granules. Together with the notion of similarity, we formally prove some intuitive properties of the indistinguishability relation for both qualitative and quantitative granularity, that with a given granulation there must be at least two granules (levels of granularity) for it to be granular, and derive a strict order between finer and coarser granules. Based on these results, granulation hierarchy is defined as extra assisting structure to augment implementations.
Keywords :
equivalence classes; formal logic; coarser-grained granule; distinguishable entities; equivalence relation; finer-grained granule; granulation hierarchy; indistinguishability relation; qualitative granularity; quantitative granularity; Algorithm design and analysis; Classification tree analysis; Clustering algorithms; Computer science; Data mining; Ontologies; Proteins; Testing;
Conference_Titel :
Granular Computing, 2007. GRC 2007. IEEE International Conference on
Conference_Location :
Fremont, CA
Print_ISBN :
978-0-7695-3032-1
DOI :
10.1109/GrC.2007.29