A new interpoint distance-based clustering algorithm using kernel density estimation
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910582649651200 |
|---|---|
| author | Modak, Soumita |
| author_facet | Modak, Soumita |
| contents | A novel nonparametric clustering algorithm is proposed using the interpoint distances between the members of the data to reveal the inherent clustering structure existing in the given set of data, where we apply the classical nonparametric univariate kernel density estimation method to the interpoint distances to estimate the density around a data member. Our clustering algorithm is simple in its formation and easy to apply resulting in well-defined clusters. The algorithm starts with objective selection of the initial cluster representative and always converges independently of this choice. The method finds the number of clusters itself and can be used irrespective of the nature of underlying data by using an appropriate interpoint distance measure. The cluster analysis can be carried out in any dimensional space with viability to high-dimensional use. The distributions of the data or their interpoint distances are not required to be known due to the design of our procedure, except the assumption that the interpoint distances possess a density function. Data study shows its effectiveness and superiority over the widely used clustering algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_00901 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A new interpoint distance-based clustering algorithm using kernel density estimation Modak, Soumita Methodology Applications 62H30 A novel nonparametric clustering algorithm is proposed using the interpoint distances between the members of the data to reveal the inherent clustering structure existing in the given set of data, where we apply the classical nonparametric univariate kernel density estimation method to the interpoint distances to estimate the density around a data member. Our clustering algorithm is simple in its formation and easy to apply resulting in well-defined clusters. The algorithm starts with objective selection of the initial cluster representative and always converges independently of this choice. The method finds the number of clusters itself and can be used irrespective of the nature of underlying data by using an appropriate interpoint distance measure. The cluster analysis can be carried out in any dimensional space with viability to high-dimensional use. The distributions of the data or their interpoint distances are not required to be known due to the design of our procedure, except the assumption that the interpoint distances possess a density function. Data study shows its effectiveness and superiority over the widely used clustering algorithms. |
| title | A new interpoint distance-based clustering algorithm using kernel density estimation |
| topic | Methodology Applications 62H30 |
| url | https://arxiv.org/abs/2305.00901 |