An agglomerative hierarchical clustering by finding adjacent hyper-rectangles

Authors:
Noboru Takagi
Affiliations:
Department of Intelligent Systems Design, Toyama Prefectural University
Venue:
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Year:
2006

Citing 2
Cited 0

RSES and RSESlib - A Collection of Tools for Rough Set Computations

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
A New Version of Rough Set Exploration System

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new clustering method based on connecting adjacent hyper-rectangles. Our method searches a set of hyper-rectangles that satisfies the properties that (1) each hyper-rectangle covers some of the samples, and (2) each sample is covered by at least one of the hyper-rectangles. Then, a correction of connected hyper-rectangles is assumed to be a cluster. We apply agglomerative hierarchical clustering method to realize the clustering based on connecting adjacent hyper-rectangles. The effectiveness of the proposed method is shown by applying artificial data sets. This paper also considers on a way for speeding up of the agglomerative hierarchical clustering.