Fast sparse representative tree splitting via local density for large-scale clustering
Abstract Large-scale clustering remains an active yet challenging task in data mining and machine learning, where existing algorithms often struggle to balance efficiency, accuracy, and adaptability. This paper proposes a novel large-scale clustering framework with three key innovations: (1) Paramet...
Saved in:
| Main Authors: | Renmin Wang, Jie Li |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-08-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-13848-w |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Minimal and Simplified Analysis of Hierarchical Density-Based Spatial Clustering
by: Kayumov Abduaziz, et al.
Published: (2025-01-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs
by: Sukanta Ghadei, et al.
Published: (2025-06-01) -
Superpixel Segmentation Algorithm by Spatial Constrained Density Clustering
by: HAN Jian-hui, et al.
Published: (2020-12-01) -
FedWT: Federated Learning with Minimum Spanning Tree-based Weighted Tree Aggregation for UAV networks
by: Geonhui Kim, et al.
Published: (2025-04-01)