- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes ICG-DPC for large-scale density peak clustering. It uses regional sampling and adaptive granular-ball splitting to reduce computation. The CPU updates the ball structure while the GPU computes densities and density peaks asynchronously. Boundary correction and global center selection produce the final clusters. Experiments on ten datasets report clustering quality and runtime, including datasets with over ten million samples.
Critical strengths
The paper addresses a practical problem: reducing the cost of clustering large datasets. Assigning structural updates to the CPU and numerical computation to the GPU is a reasonable design.
Critical weaknesses
The main contributions are not directly validated. There is no comparison between synchronous and asynchronous versions of the same algorithm, and no component ablations. Hardware, parameter settings, timing boundaries, and variability across runs are not reported. Comparisons with closely related methods, including GB-DP, AGB-DP, and UP-DPC, are also missing.
Important algorithm rules and evaluation details remain unclear. The paper does not fully specify center selection, label correction, assignment of unsampled points, or handling of outdated GPU results. Some reported scores also need clarification. For example, DPC achieves ACC = 0.396 on SUSY. If it produces two clusters and ACC uses optimal label matching, this score should be at least 0.5. The actual cluster counts and evaluation procedure are therefore essential.
Questions for authors
How are ACC and NMI calculated, and how many clusters does each method produce? Can you explain the SUSY result above?
What are the exact splitting, center-selection, and label-correction rules? How are unsampled points assigned to final granular balls?
How do you prevent outdated GPU results from affecting the final output? Is a final consistency check performed?