Hierarchical clustering of non-euclidean relational data using indiscernibility-level

Authors:
Shoji Hirano;Shusaku Tsumoto
Affiliations:
Department of Medical Informatics, Shimane University, School of Medicine, Izumo, Shimane, Japan;Department of Medical Informatics, Shimane University, School of Medicine, Izumo, Shimane, Japan
Venue:
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Year:
2008

Citing 1
Cited 1

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

On the relation between jumping emerging patterns and rough set theory with application to data classification

Transactions on rough sets XII

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a clustering method for non-Euclidean relational data based on the combination of indiscernibility level and linkage algorithm. Indiscernibility level quantifys the level of global agreement for classifying two objects into the same category as indiscernible objects. Single-linkage grouping is then used to merge objects according to the indiscernibility level from bottom to top and construct the dendrogram. This scheme enables users to examine the hierarchy of data granularity and obtain the set of indiscernible objects that meets the given level of granularity. Additionally, since indiscernibility level is derived based on the binary classifications assigned independently to each object, it can be applied to non-Euclidean, asymmetric relational data.