Abstract

We proposed a universal clustering algorithm by constructing an adaptive density gradient. This algorithm showed no data preference, and performs well on data with arbitrary density, overlap and shape. In comparative experiments, it outperformed other state-of-the-art algorithms on all types of synthetic and real data.