• DocumentCode
    2334543
  • Title

    Indiscernibility degree of objects for evaluating simplicity of knowledge in the clustering procedure

  • Author

    Hirano, Shoji ; Tsumoto, Shusaku

  • Author_Institution
    Dept. of Med. Informatics, Shimane Med. Univ., Izumo, Japan
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    211
  • Lastpage
    217
  • Abstract
    The paper presents a novel, rough set-based clustering method that enables the evaluation of classification knowledge simplicity during the clustering procedure. The method iteratively refines equivalence relations so that they become a more simple set of relations that give adequate coarse classification to the objects. At each step of the iteration, the importance of the equivalence relation is evaluated on the basis of the newly introduced measure, indiscernibility degree. An indiscernibility degree is defined as a ratio of equivalence relations that classify the two objects into the same equivalence class. If an equivalence relation has the ability to discern two objects that have a high indiscernibility degree, a very fine classification is performed and then modified to regard them as indiscernible objects. The refinement is repeated, decreasing the threshold level of indiscernibility degree, and finally simple clusters can be obtained. Experimental results on the artificial data shows that iterative refinement of equivalence relation leads to successful generation of coarse clusters that can be represented by simple knowledge
  • Keywords
    data mining; equivalence classes; pattern clustering; rough set theory; very large databases; artificial data; classification knowledge simplicity evaluation; clustering procedure; coarse classification; coarse clusters; equivalence class; equivalence relation; equivalence relations; indiscernibility degree; iterative refinement; rough set-based clustering method; simple clusters; threshold level; Algorithm design and analysis; Biomedical informatics; Clustering algorithms; Clustering methods; Data analysis; Databases; Rough sets; Scalability; Sections; Set theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on
  • Conference_Location
    San Jose, CA
  • Print_ISBN
    0-7695-1119-8
  • Type

    conf

  • DOI
    10.1109/ICDM.2001.989521
  • Filename
    989521