Answers are grounded in this paper and cite their sources.
This paper proposes a new method called depth difference (DeD), for estimating the optimal number of clusters ( k ) in a dataset based on data depth. The DeD method estimates the k parameter before actual clustering is constructed. We define the depth within clusters, depth between clusters, and depth difference to finalize the optimal value of k , which is an input value for the clustering algorithm. The experimental comparison with the leading state-of-the-art alternatives demonstrates that the proposed DeD method outperforms.
No takes yet. Share an insight, caveat, or question.
Patil et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: