Estimating the Optimal Number of Clusters k in a Dataset Using Data Depth
Abstract 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,...
Main Authors: | Channamma Patil, Ishwar Baidari |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-06-01
|
Series: | Data Science and Engineering |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41019-019-0091-y |
Similar Items
-
A Criterion for Deciding the Number of Clusters in a Dataset Based on Data Depth
by: Ishwar Baidari, et al.
Published: (2020-11-01) -
Fast Adaptive Coding Unit Depth Range Selection Algorithm for High Efficiency Video Coding
by: Fang Shuqing, et al.
Published: (2014-12-01) -
Depth Estimation From a Single Image Using Guided Deep Network
by: Minsoo Song, et al.
Published: (2019-01-01) -
Deep Learning-Based Monocular Depth Estimation Methods—A State-of-the-Art Review
by: Faisal Khan, et al.
Published: (2020-04-01) -
Superpixel Segmentation Using Weighted Coplanar Feature Clustering on RGBD Images
by: Zhuoqun Fang, et al.
Published: (2018-05-01)