Fast density peak clustering for large scale data based on kNN
The DOI matches its Crossref record.
Abstract
Abstract Density Peak (DPeak) clustering algorithm is not applicable for large scale data, due to two quantities, i.e, ρ and δ , are both obtained by brute force algorithm with complexity O ( n 2 ) . Thus, a simple but fast DPeak, namely FastDPeak, 1 is proposed, which runs in about O ( n l o g ( n ) ) expected time in the intrinsic dimensionality. It replaces density with kNN-density, which is computed by fast kNN algorithm such as cover tree, yielding huge improvement for density computations. Based on kNN-density, local density peaks and non-local density peaks are identified, and a fast algorithm, which uses two different strategies to compute δ for them, is also proposed with complexity O ( n ) . Experimental results show that FastDPeak is effective and outperforms other variants of DPeak.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Fast hierarchical clustering of local density peaks via an association degree transfer method
Guan, J., Li, S., He, X., Zhu, J., & Chen, J. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.05.071 · Cited by 73
Semi‐supervised classification of fundus images combined with CNN and GCN
Duan, S., Huang, P., Chen, M., Wang, T., Sun, X., Chen, M., Dong, X., Jiang, Z., & Li, D. (2022) · Journal of Applied Clinical Medical Physics · doi:10.1002/acm2.13746 · Cited by 29
“N k ( j ) represents the set of k-nearest neighbor (KNN) 27 of vertex i .”
BackgroundMechanism of Tethered Agonist Binding to an Adhesion G-Protein-Coupled Receptor
(2025) · doi:10.1021/acs.jpcb.5c05305 · Cited by 4
Metadata
- Authors
- Chen, Y., Hu, X., Fan, W., Shen, L., Zhang, Z., Liu, X., Du, J., Li, H., Chen, Y., & Li, H.
- Venue
- Knowledge-Based Systems
- Publisher
- Elsevier BV
- Published
- 2020-01
- Volume
- 187
- Pages
- 104824
- ISSN
- 0950-7051 (ISSN-L)
- OpenAlex
- W2953618482
- Cited by
- 234
- References
- 0
- FWCI
- 14.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.