Choosing the cluster to split in bisecting divisive clustering algorithms
نویسندگان
چکیده
This paper deals with the problem of clustering a data-set. In particular, the bisecting divisive approach is here considered. This approach can be naturally divided into two sub-problems: the problem of choosing which cluster must be divided, and the problem of splitting the selected cluster. The focus here is on the first problem. The contribution of this work is to propose a new simple technique for the selection of the cluster to split. This technique is based upon the shape of the cluster. This result is presented with reference to two specific splitting algorithms: the celebrated bisecting K-means algorithm, and the recently proposed Principal Direction Divisive Partitioning (PDDP) algorithm. The problem of evaluating the quality of a partition is also discussed.
منابع مشابه
Cluster Selection in Divisive Clustering Algorithms
The problem this paper focuses on is the classical problem of unsupervised clustering of a data-set. In particular, the bisecting divisive clustering approach is here considered. This approach consists in recursively splitting a cluster into two sub-clusters, starting from the main data-set. This is one of the more basic and common problems in fields like pattern analysis, data mining, document...
متن کاملOn the performance of bisecting K - means and PDDP * Sergio
problem is known as bisecting divisive clustering. Note that by recursively using a divisive bisecting clustering procedure, the dataset can be partitioned into any given number of clusters. Interestingly enough, the clusters so-obtained are structured as a hierarchical binary tree (or a binary taxonomy). This is the reason why the bisecting divisive approach is very attractive in many applicat...
متن کاملOn the performance of bisecting K-means and PDDP
The problem this paper focuses on is the unsupervised clustering of a data-set. The dataset is given by the matrix [ ] N p N x x x M × R ∈ = ,..., , 2 1 , where each column of M, p i x R ∈ , is a single data-point. This is one of the more basic and common problems in fields like pattern analysis, data mining, document retrieval, image segmentation, decision making, etc. ([12, 13]). The specific...
متن کاملA comparative analysis on the bisecting K-means and the PDDP clustering algorithms
This paper deals with the problem of clustering a data set. In particular, the bisecting divisive partitioning approach is here considered. We focus on two algorithms: the celebrated K-means algorithm, and the recently proposed Principal Direction Divisive Partitioning (PDDP) algorithm. A comparison of the two algorithms is given, under the assumption that the data set is uniformly distributed ...
متن کاملBisecting K-means and PDDP: A Comparative Analysis
This paper deals with the problem of clustering a data−set. In particular, the bisecting divisive partitioning approach is here considered. We focus on two algorithms: the celebrated K−means algorithm, and the recently proposed Principal Direction Divisive Partitioning (PDDP) algorithm. A comparison of the two algorithms is given, under the assumption that the data set is uniformly distributed ...
متن کامل