2019
DOI: 10.3390/make1020042
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Clustering and Cluster Identity in Understanding High-Dimensional Data Spaces with Tightly Distributed Points

Abstract: The sensitivity of the elbow rule in determining an optimal number of clusters in high-dimensional spaces that are characterized by tightly distributed data points is demonstrated. The high-dimensional data samples are not artificially generated, but they are taken from a real world evolutionary many-objective optimization. They comprise of Pareto fronts from the last 10 generations of an evolutionary optimization computation with 14 objective functions. The choice for analyzing Pareto fronts is strategic, as … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 25 publications
(46 reference statements)
0
3
0
Order By: Relevance
“…The mean time each hen spent at each of the four different areas was used as the input for the calculation of the Calinski-Harabasz criterion. The Calinski-Harabasz criterion is defined in Equation ( 1) [19,20], as follows:…”
Section: Cluster Optimisationmentioning
confidence: 99%
“…The mean time each hen spent at each of the four different areas was used as the input for the calculation of the Calinski-Harabasz criterion. The Calinski-Harabasz criterion is defined in Equation ( 1) [19,20], as follows:…”
Section: Cluster Optimisationmentioning
confidence: 99%
“…Clustering methods divide the objects into specific groups, with the goal that all data objects assigned to the same cluster have common characteristics, while different clusters have distinct characteristics (Darby, 2005). The cluster-ing methods have been widely used in climate and environmental research (Bardossy et al, 1995;Cavazos, 2000;Luo and Lau, 2017;Bernier et al, 2019).…”
Section: K-means Clusteringmentioning
confidence: 99%
“…The Elbow standard calculates the sum of squared errors (SSE) to determine the number of clusters. As the number of clusters increases, SSE decreases accordingly; when the decline slows down, an inflection point arises, and the cluster value at the inflection point is used as the optimal number of clusters [50]. The Calinsky criterion evaluates the local optimal clustering number by calculating the SSE between groups and the SSE within a group.…”
Section: Drought Spatial Distribution Pattern Identificationmentioning
confidence: 99%