<unk>  (balanced iterative reducing and clustering using hierarchies) is an unsupervised data mining algorithm used to perform hierarchical clustering over particularly large data-sets. With modifications it can also be used to accelerate k-means clustering and Gaussian mixture modeling with the expectation–maximization algorithm. An advantage of<unk>  is its ability to incrementally and dynamically cluster incoming, multi-dimensional metric data points in an attempt to produce the best quality clustering for a given set of resources (memory and time constraints). In most cases,<unk>  only requires a single scan of the database. Its inventors claim<unk>  to be the "first clustering algorithm proposed in the database area to handle 'noise' (data points that are not part of the underlying pattern) effectively", beating DBSCAN by two months. The<unk>  algorithm received the SIGMOD 10 year test of time award in 2006.
BIRCH
DRACO
NOMESCO
MERS
AMELY
FLOW 
BIRDEM
SBAR