A novel graph-based clustering method using noise cutting

作者：

Highlights：

• The strategy of detecting out the noise points is straightforward and efficient.

• It is able to detect clusters with arbitrary shapes and outliers automatically.

• The proposed approach does not require any parameters from users.

• The method has the superiority compared with the other described in the paper.

摘要

•The strategy of detecting out the noise points is straightforward and efficient.•It is able to detect clusters with arbitrary shapes and outliers automatically.•The proposed approach does not require any parameters from users.•The method has the superiority compared with the other described in the paper.

论文关键词：Graph-based clustering,Natural neighbors,Noise cutting

论文评审过程：Received 12 December 2019, Revised 14 January 2020, Accepted 18 January 2020, Available online 21 January 2020, Version of Record 23 January 2020.

论文官网地址：https://doi.org/10.1016/j.is.2020.101504