Indiscernibility-based clustering: rough clustering

  • Authors:

  • Shoji Hirano;Shusaku Tsumoto

  • Affiliations:

  • Department of Medical Informatics, Shimane Medical University, School of Medicine, Izumo, Shimane, Japan;Department of Medical Informatics, Shimane Medical University, School of Medicine, Izumo, Shimane, Japan

  • Venue:
  • IFSA'03 Proceedings of the 10th international fuzzy systems association World Congress conference on Fuzzy sets and systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new indiscernibility-based clustering method called rough clustering, that works on relative proximity. Our method lies its basis on iterative refinement of N binary classifications, where N denotes the number of objects. First, for each of N objects, an equivalence relation that classifies all the other objects into two classes, similar and dissimilar, is assigned by referring to their relative proximity. Next, for each pair of the objects, we count the number of binary classifications in which the pair is included in the same class. We call this number as indiscernibility degree. If the indiscernibility degree of a pair is larger than a user-defined threshold value, we modify the equivalence relations so that all of them commonly classify the pair into the same class. This process is repeated until class assignment becomes stable. Consequently, we obtain the clustering result that follows given level of granularity without using geometric measures.