ACM Computing Surveys (CSUR)
Clustering Algorithms
Techniques of Cluster Algorithms in Data Mining
Data Mining and Knowledge Discovery
Landscape of Clustering Algorithms
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Relational Analysis for Consensus Clustering from Multiple Partitions
ICMLA '08 Proceedings of the 2008 Seventh International Conference on Machine Learning and Applications
Survey of clustering algorithms
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
Our main goal is to introduce three clustering functions based on the central tendency deviation principle. According to this approach, we consider to cluster two objects together providing that their similarity is above a threshold. However, how to set this threshold ? This paper gives some insights regarding this issue by extending some clustering functions designed for categorical data to the more general case of real continuous data. In order to approximately solve the corresponding clustering problems, we also propose a clustering algorithm. The latter has a linear complexity in the number of objects and doesn't require a pre-defined number of clusters. Then, our secondary purpose is to introduce a new experimental protocol for comparing different clustering techniques. Our approach uses four evaluation criteria and an aggregation rule for combining the latter. Finally, using fifteen data-sets and this experimental protocol, we show the benefits of the introduced cluster analysis methods.