Taxonomy-independent analysis plays an essential role in microbial community analysis. Hierarchical clustering is one of the most widely employed approaches to finding operational taxonomic units, the basis for many downstream analyses. Most existing algorithms have quadratic space and computational complexities, and thus can be used only for small or medium-scale problems. We propose a new onl...

Clustering is among the oldest techniques used in data mining applications. Typical implementations of the hierarchical agglomerative clustering methods (HACM) require an amount of O(N)-space when there are N data objects, making such algorithms impractical for problems involving large datasets. The well-known clustering algorithm RNN-CLINK requires only O(N)-space but O(N)-time in the worst ca...

In this paper we present a method for unsupervised clustering of image databases. The method is based on a recently introduced information-theoretic principle, the information bottleneck (IB) principle. Image archives are clustered such that the mutual information between the clusters and the image content is maximally preserved. The IB principle is applied to both discrete and continuous image...

Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...

In this paper several probabilistic search techniques are developed for global optimization under three heuristic classi"cations: simulated annealing, clustering methods and adaptive partitioning algorithms. The algorithms proposed here combine di!erent methods found in the literature and they are compared with well-established approaches in the corresponding areas. Computational results are ob...

A guarantee is only as good as its assumptions. Three group membership areas defy firm, practical guarantees: transient faults, reintegration, and large groups. We show why these areas are problematic, discuss current approaches, and illustrate alternative approaches that may lead to a more dependable system. Ultimately, designs should be tested against a comprehensive fault model, and a probab...

We provide a probabilistic analysis of the output of Quicksort when comparisons can err.

We give a probabilistic analysis of parameters related to α-gapped repeats and palindromes in random words, under both uniform and memoryless distributions (where letters have different probabilities, but are drawn independently). More precisely, we study the expected number of maximal α-gapped patterns, as well as the expected length of the longest α-gapped pattern in a random word. 1998 ACM S...