142 search results - page 3 / 29 » Clustering Large Datasets in Arbitrary Metric Spaces |
JPDC
2007
13 years 5 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
CCGRID
2004
IEEE
13 years 9 months ago
2004
IEEE
This paper is concerned with efficient querying of very large multi-resolution datasets on storage and compute clusters. We present a suite of services that support storage, index...
SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
JAIR
2010
13 years 3 months ago
2010
While traditional research on text clustering has largely focused on grouping documents by topic, it is conceivable that a user may want to cluster documents along other dimension...