Short Communication on QUIST: A Quick Clustering Algorithm

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.

READ FULL TEXT

page 1

page 2

page 3

research
09/13/2017

An efficient clustering algorithm from the measure of local Gaussian distribution

In this paper, I will introduce a fast and novel clustering algorithm ba...
research
10/09/2018

Improvement of K Mean Clustering Algorithm Based on Density

The purpose of this paper is to improve the traditional K-means algorith...
research
07/11/2021

Hybrid Ant Swarm-Based Data Clustering

Biologically inspired computing techniques are very effective and useful...
research
04/10/2010

New Clustering Algorithm for Vector Quantization using Rotation of Error Vector

The paper presents new clustering algorithm. The proposed algorithm give...
research
09/13/2022

Genie: A new, fast, and outlier-resistant hierarchical clustering algorithm

The time needed to apply a hierarchical clustering algorithm is most oft...
research
06/19/2019

Supervised Hierarchical Clustering with Exponential Linkage

In supervised clustering, standard techniques for learning a pairwise di...
research
06/18/2012

Efficient Active Algorithms for Hierarchical Clustering

Advances in sensing technologies and the growth of the internet have res...

Please sign up or login with your details

Forgot password? Click here to reset