Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy

Recently a density peaks based clustering algorithm (dubbed as DPC) was proposed to group data by setting up a decision graph and finding out cluster centers from the graph fast. It is simple but efficient since it is noniterative and needs few parameters. However, the improper selection of its para...

Full description

Bibliographic Details

Published in:	Knowledge-based systems Vol. 133; pp. 208 - 220
Main Authors:	Yaohui, Liu, Zhengming, Ma, Fang, Yu
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.10.2017 Elsevier Science Ltd
Subjects:	Adaptive algorithms Aggregating Algorithms Clustering Clustering algorithm Clusters Density Density peaks Experiments K-nearest neighbors K-nearest neighbors Density peaks Clustering algorithm Aggregating
ISSN:	0950-7051, 1872-7409
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!