Journal Article10.1109/TPDS.2005.72
Efficient parallel hierarchical clustering algorithms
TL;DR: In this paper, the authors present parallel algorithms with better performance than known algorithms and consider algorithms that work well in the worst case as well as algorithms with good expected performance, and present algorithms that have better expected performance.
read more
Abstract: Clustering of data has numerous applications and has been studied extensively. Though most of the algorithms in the literature are sequential, many parallel algorithms have also been designed. In this paper, we present parallel algorithms with better performance than known algorithms. We consider algorithms that work well in the worst case as well as algorithms with good expected performance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A model for quantitative evaluation of an end-to-end question-answering system
Nina Wacholder,Diane Kelly,Paul B. Kantor,Robert Rittman,Ying Sun,Bing Bai,Sharon G. Small,Boris Yamrom,Tomek Strzalkowski +8 more
TL;DR: It is concluded that this method, which uses a surprisingly small number of subjects and does not rely on predetermined relevance judgments, measures the impact of system change on work produced by users, and can be used to compare the product of interactive systems that use different underlying technologies.
448
COALA: A Novel Approach for the Extraction of an Alternate Clustering of High Quality and High Dissimilarity
Eric Bae,James Bailey +1 more
- 18 Dec 2006
TL;DR: The critical requirements for systematically finding a new clustering, given that an already known clustering is available are explored and a novel algorithm, COALA, is proposed, which is able to outperform existing techniques, for both synthetic and real datasets.
Reciprocity between the cerebellum and the cerebral cortex: Nonlinear dynamics in microscopic modules for generating voluntary motor commands
TL;DR: A detailed model of one microscopic loop between the motor cortex and the cerebellum is presented, and it is shown how small arrays of these microscopic loops can be used to generate biologically plausible motor commands for controlling movement.
Connected Components in MapReduce and Beyond
Raimondas Kiveris,Silvio Lattanzi,Vahab Mirrokni,Vibhor Rastogi,Sergei Vassilvitskii +4 more
- 03 Nov 2014
TL;DR: This paper designs improved algorithms based on traditional MapReduce architecture for large scale data analysis that have provable theoretical guarantees, and easily outperform previously studied algorithms.
100
Geographical information system parallelization for spatial big data processing: a review
TL;DR: The general evolution of the GIS architecture is presented which includes main two parallel GIS architectures based on high performance computing cluster and Hadoop cluster and the current spatial data partition strategies, key methods to realize Parallel GIS in the view of data decomposition and progress of the special parallel Gis algorithms are summarized.
81
References
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
4.9K
•Book
An introduction to parallel algorithms
Joseph JaJa
- 01 Oct 1992
TL;DR: This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.
Closest-point problems
Michael Ian Shamos,Dan Hoey +1 more
- 13 Oct 1975
TL;DR: The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.
1.2K
On constructing minimum spanning trees in k-dimensional spaces and related problems
TL;DR: By employing a subroutine that solves the post office problem, it is shown that, for fixed k $\geq$ 3, such a minimum spanning tree can be found in time O($n^{2-a(k)} {(log n)}^{1-a (k)}$), where a(k) = $2^{-(k+1)}$.
716
A randomized linear-time algorithm to find minimum spanning trees
TL;DR: A randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights is presented, a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.
493