Sciweavers

5659 search results - page 158 / 1132
» Comparing Clusterings in Space
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
12 years 17 days ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
IPPS
1999
IEEE
14 years 2 months ago
A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
S. Chingchit, Mohan Kumar, Laxmi N. Bhuyan
ICMCS
2010
IEEE
169views Multimedia» more  ICMCS 2010»
13 years 11 months ago
Comparison of clustering approaches for summarizing large populations of images
This paper compares the efficacy and efficiency of different clustering approaches for selecting a set of exemplar images, to present in the context of a semantic concept. We eval...
Yushi Jing, Michele Covell, Henry A. Rowley
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
12 years 17 days ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
14 years 3 months ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba