A clustering algorithm based on grids for core data and adjacency relationships for edge data
Abstract Grid-based clustering algorithms have become a crucial method in the field of data mining due to their efficiency. However, they face challenges such as parameter sensitivity, poor adaptability to density variations, and misclassification of edge data. To address these issues, existing rese...
Saved in:
| Main Author: | Honglei He |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-05-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-00532-2 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Adaptive k-means clustering algorithm based on grid and domain centroid weight
by: Wei CAI, et al.
Published: (2025-05-01) -
Big Data Analytics: A Tutorial of Some Clustering Techniques
by: Said Baadel
Published: (2021-09-01) -
APPLICATION OF CLUSTERING ANALYSIS TO DATA DISTRIBUTION OF COVID-19 IN BENGKULU PROVINCE
by: Nurul Hidayati
Published: (2022-06-01) -
Improvement of Differential Privacy K-means Clustering Algorithm
by: GUO Rumin, et al.
Published: (2024-08-01) -
Clustering Library Loan Books Using K-Means Clustering
by: Mawar Indah Tanjung, et al.
Published: (2025-03-01)