Log in to save to my catalogue

Density peaks clustering based on k-nearest neighbors and self-recommendation

Density peaks clustering based on k-nearest neighbors and self-recommendation

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2920285366

Density peaks clustering based on k-nearest neighbors and self-recommendation

About this item

Full title

Density peaks clustering based on k-nearest neighbors and self-recommendation

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

Journal title

International journal of machine learning and cybernetics, 2021-07, Vol.12 (7), p.1913-1938

Language

English

Formats

Publication information

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

More information

Scope and Contents

Contents

Density peaks clustering (DPC) model focuses on searching density peaks and clustering data with arbitrary shapes for machine learning. However, it is difficult for DPC to select a cut-off distance in the calculation of a local density of points, and DPC easily ignores the cluster centers with lower density in datasets with variable densities. In a...

Alternative Titles

Full title

Density peaks clustering based on k-nearest neighbors and self-recommendation

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_2920285366

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2920285366

Other Identifiers

ISSN

1868-8071

E-ISSN

1868-808X

DOI

10.1007/s13042-021-01284-x

How to access this item