Short Communication on QUIST: A Quick Clustering Algorithm
arXiv:1606.00398v11 citations
Originality Synthesis-oriented
AI Analysis
This work addresses the need for efficient clustering in data analysis, but it appears incremental as it builds on existing hierarchical methods.
The authors introduced QUIST, a quick hierarchical clustering algorithm that operates without prior knowledge of cluster count or size and is insensitive to input ordering, achieving poly-logarithmic efficiency.
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.