Choosing the Cluster to Split in Bisecting Divisive Clustering Algorithms
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Choosing the Cluster to Split in Bisecting Divisive Clustering Algorithms
Published Date
2000-10-26
Publisher
Type
Report
Abstract
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.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Savaresi, Sergio M.; Boley, Daniel; Bittanti, Sergio; Gazzaniga, Giovanna. (2000). Choosing the Cluster to Split in Bisecting Divisive Clustering Algorithms. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215443.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.