Abstract. Evaluation of clustering partitions is a crucial step in data processing. A multitude of measures exists, which- unfortunately- give for one data set various results. In this paper we present a visualization technique to visualize single clusters of high-dimensional data. Our method maps

multi-dimensional metric data points to try to produce the best quality clustering with the available resources (i. e., available memory and time constraints). BIRCH can typically find a goocl clustering with a single scan of the data, and improve the quality further with a few aclditioual scans. BIRCH

This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse

My thesis is concerned with task allocation in multi-robot teams operating in dynamic environments. The key contribution of this work is the development of a distributed multi-robot task allocation auction that allocates clusters of tasks to robots over multiple bidding rounds. Empirical evaluation

task, but differ completely at the levels of synaptic strengths and single-unit responses. However, hierarchical clustering techniques applied to NETtalk reveal that these different networks have similar internal representations of letter-to-sound correspondences within groups of processing units

describes an approach to using these features for object recognition. The recognition proceeds by matching individual features to a database of features from known objects using a fast nearest-neighbor algorithm, followed by a Hough transform to identify clusters belonging to a single object

to leading feature-based SLAM algorithms in challenging measurement scenarios with high false alarm rates, high missed detection rates, and high levels of measurement noise. We investigate this approach further by considering a hierarchical point process, or single-cluster multi-object, model, where we

simultaneously on multi-ple computers, or on multiple CPU cores within a computer. The application can discover the size and placement of data at run time, and modify the graph as the computation pro-gresses to make efficient use of the available resources. Dryad is designed to scale from powerful multi-core sin-gle

single run. However, the few comparative studies of different methods presented up to now remain mostly qualitative and are often restricted to a few approaches. In this paper, four multiobjective EA’s are compared quantitatively where an extended 0/1 knapsack problem is taken as a basis. Furthermore, we

by the observation that different types of messages exchanged between sensor nodes have different security requirements, and that a single keying mechanism is not suitable for meeting these different security requirements. LEAP supports the establishment of four types of keys for each sensor node – an individual key