Robust clustering using a kNN mode seeking ensemble

作者：

Highlights：

• A new clustering ensemble based on kNN mode seeking is proposed.

• The algorithm is robust with respect to hyperparameters–no manual tuning needed.

• The algorithm is faster than the state-of-the art and able to handle high-dimensional data sets.

摘要

•A new clustering ensemble based on kNN mode seeking is proposed.•The algorithm is robust with respect to hyperparameters–no manual tuning needed.•The algorithm is faster than the state-of-the art and able to handle high-dimensional data sets.

论文关键词：Density based clustering,Consensus clustering,kNN mode seeking,Mean shift,Ensemble clustering

论文评审过程：Received 5 August 2016, Revised 25 April 2017, Accepted 18 November 2017, Available online 2 December 2017, Version of Record 21 December 2017.

论文官网地址：https://doi.org/10.1016/j.patcog.2017.11.023