We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/Estimating the Optimal Number of Clusters k in a Dataset Using Data Depth
PeriodicalsMathematics

Estimating the Optimal Number of Clusters k in a Dataset Using Data Depth

Checking your access to this record.

Abstract & Overview

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.

Cite this record

Channamma Patil, Ishwar Baidari (2019). Estimating the Optimal Number of Clusters k in a Dataset Using Data Depth. Data Science and Engineering, 4(2), 132–140. https://doi.org/10.1007/s41019-019-0091-y

Copy in another style

Patil, C., & Baidari, I. (2019). Estimating the Optimal Number of Clusters k in a Dataset Using Data Depth. Data Science and Engineering, 4(2), 132–140. https://doi.org/10.1007/s41019-019-0091-y
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.