Rock: A robust clustering algorithm for categorical attributes

Sudipto Guha

doi:10.1016/S0306-4379(00)00022-3

Rock: A robust clustering algorithm for categorical attributes

2000-07-01

604

PRE

AI

DOI：10.1016/S0306-4379(00)00022-3

原文链接

原文求助

摘要

En 中文

Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) similarity measure in order to partition the database such that data points in the same partition are more similar than points in different partitions. In this paper, we study clustering algorithms for data with boolean and categorical attributes. We show that traditional clustering algorithms that use distances between points for clustering are not appropriate for boolean and categorical attributes. Instead, we propose a novel concept of links to measure the similarity/proximity between a pair of data points. We develop a robust hierarchical clustering algorithm ROCK that employs links and not distances when merging clusters. Our methods naturally extend to non-metric similarity measures that are relevant in situations where a domain expert/similarity table is the only source of knowledge. In addition to presenting detailed complexity results for ROCK, we also conduct an experimental study with real-life as well as synthetic data sets to demonstrate the effectiveness of our techniques. For data with categorical attributes, our findings indicate that ROCK not only generates better quality clusters than traditional algorithms, but it also exhibits good scalability properties. (C) 2000 Published by Elsevier Science Ltd.

Keyword:

data mining

knowledge discovery

clustering algorithms

Rock: A robust clustering algorithm for categorical attributes

摘要

AI总结

期刊

机构

引用论文