Short Communication on QUIST: A Quick Clustering Algorithm

TL;DR

This paper introduces QUIST, a fast hierarchical clustering algorithm that efficiently groups data without prior knowledge of cluster count or size, and is robust to input order.

Contribution

The paper presents QUIST, a novel poly-logarithmic divisive clustering algorithm that improves efficiency and robustness over existing methods.

Findings

QUIST is a poly-logarithmic divisive clustering algorithm.

It does not require prior knowledge of cluster number or size.

QUIST is insensitive to input data ordering.

Abstract

In this short communication we introduce the quick clustering algorithm (QUIST), an efficient hierarchical clustering algorithm based on sorting. QUIST is a poly-logarithmic divisive clustering algorithm that does not assume the number of clusters, and/or the cluster size to be known ahead of time. It is also insensitive to the original ordering of the input.