DensityCut

densityCut is a novel density-based clustering algorithm, which is both time- and space-efficient. It first roughly estimates the densities of data points from a K-nearest neighbour graph and then refines the densities via a random walk.

• Publication: Jiarui Ding, Sohrab Shah and Anne Condon. densityCut: an efficient and versatile topologicalapproach for automatic clustering of biological data. Bioinformatics, 2016.