This paper addresses the relationship between the Visual Assessment of cluster Tendency (VAT) algorithm and Dunn’s cluster validity index. We present an analytical comparison in...
Timothy C. Havens, James C. Bezdek, James M. Kelle...
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
Bonnie K. Ray, Hisashi Kashima, Jianying Hu, Monin...
Fuzzy C-Means (FCM) and hard clustering are the most common tools for data partitioning. However, the presence of noisy observations in the data may cause generation of completely ...
Mohammad Hossein Fazel Zarandi, Milad Avazbeigi, I...