2016
DOI: 10.1371/journal.pone.0152333
|View full text |Cite
|
Sign up to set email alerts
|

Cross-Clustering: A Partial Clustering Algorithm with Automatic Estimation of the Number of Clusters

Abstract: Four of the most common limitations of the many available clustering methods are: i) the lack of a proper strategy to deal with outliers; ii) the need for a good a priori estimate of the number of clusters to obtain reasonable results; iii) the lack of a method able to detect when partitioning of a specific data set is not appropriate; and iv) the dependence of the result on the initialization. Here we propose Cross-clustering (CC), a partial clustering algorithm that overcomes these four limitations by combin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(18 citation statements)
references
References 48 publications
0
18
0
Order By: Relevance
“…In contrast to many other clustering methods, in hierarchical clustering the number of clusters is not chosen before the clustering is performed, but often from an "intuitive" inspection of a dendrogram (see below for further details) [Tellaroli et al, 2016]. Here the appropriate number of clusters (k) to extract was informed from the "gap statistic" [Tibshirani et al, 2001].…”
Section: Heat Wave Evaluation Proceduresmentioning
confidence: 99%
“…In contrast to many other clustering methods, in hierarchical clustering the number of clusters is not chosen before the clustering is performed, but often from an "intuitive" inspection of a dendrogram (see below for further details) [Tellaroli et al, 2016]. Here the appropriate number of clusters (k) to extract was informed from the "gap statistic" [Tibshirani et al, 2001].…”
Section: Heat Wave Evaluation Proceduresmentioning
confidence: 99%
“…These authors tried to find sunflower adulteration of EVOO. For this they examined the wavelengths of Finally, we should refer a new method of hierarchical clustering that combines the advantages of the strategies (1) Ward's minimum variance and (2) centroid clustering (Tellaroli, Bazzi, Donato, Brazzale, & Drăghici, 2016). The method was named by the authors "Cross Clustering (CC)" was developed in order to avoid four usual pitfalls, namely, 1. the lack of a strategy to deal with outliers; 2. the lack of an estimate of the number of clusters;…”
Section: Hierarchical Clustering (Hca) Methodsmentioning
confidence: 99%
“…Finally, we should refer a new method of hierarchical clustering that combines the advantages of the strategies (1) Ward's minimum variance and (2) centroid clustering (Tellaroli, Bazzi, Donato, Brazzale, & Drăghici, ). The method was named by the authors “Cross Clustering (CC)” was developed in order to avoid four usual pitfalls, namely, the lack of a strategy to deal with outliers; the lack of an estimate of the number of clusters; the lack of the inappropriateness of a specific partitioning; and the lack of independence of the resulting classification to the initial configuration. …”
Section: Multivariate Proceduresmentioning
confidence: 99%
“…The condensed hierarchical clustering algorithm is a bottom-up approach [31,32]. The word "condensed" means that the algorithm takes each sample as a single cluster at the initial stage.…”
Section: Condensed Hierarchical Clustering Algorithmmentioning
confidence: 99%