This paper presents a new implementation of the co-VAT algorithm. We assume we have an m × n matrix D, where the elements of D are pair-wise dissimilarities between m row objects ...
Timothy C. Havens, James C. Bezdek, James M. Kelle...
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Spatial clustering is an active research area in spatial data mining with various methods reported. In this paper, we compare two density-based methods, DBSCAN and DBRS. First, we ...
In this paper, one presents a fuzzy color clustering algorithm that is based on a new measure of similarity. This new measure of color similarity is defined on a perceptual color s...
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...