Sciweavers

2600 search results - page 20 / 520
» Clustering with or without the Approximation
Sort
View
FOCM
2007
55views more  FOCM 2007»
13 years 7 months ago
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theo...
Marc Giusti, Grégoire Lecerf, Bruno Salvy, ...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
14 years 9 months ago
Approximate Clustering on Distributed Data Streams
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
Qi Zhang, Jinze Liu, Wei Wang 0010
DASFAA
2008
IEEE
150views Database» more  DASFAA 2008»
14 years 2 months ago
Approximate Clustering of Time Series Using Compact Model-Based Descriptions
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
TKDE
2002
124views more  TKDE 2002»
13 years 7 months ago
Clustering for Approximate Similarity Search in High-Dimensional Spaces
In this paper we present a clustering and indexing paradigm called Clindex for high-dimensional search spaces. The scheme is designed for approximate similarity searches, where on...
Chen Li, Edward Y. Chang, Hector Garcia-Molina, Gi...