Sciweavers

524 search results - page 11 / 105
» On the Performance of Clustering in Hilbert Spaces
Sort
View
TKDE
2002
124views more  TKDE 2002»
14 years 9 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...
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
15 years 2 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
IWCC
1999
IEEE
15 years 2 months ago
Single I/O Space for Scalable Cluster Computing
In this paper, we propose a novel Single I/O Space architecture for achieving a Single System Image (SSI) at the I/O subsystem level. This is very much desired in a scalable clust...
Roy S. C. Ho, Hai Jin, Kai Hwang
PAKDD
2007
ACM
152views Data Mining» more  PAKDD 2007»
15 years 4 months ago
Spectral Clustering Based Null Space Linear Discriminant Analysis (SNLDA)
While null space based linear discriminant analysis (NLDA) obtains a good discriminant performance, the ability easily suffers from an implicit assumption of Gaussian model with sa...
Wenxin Yang, Junping Zhang
PAKDD
2009
ACM
186views Data Mining» more  PAKDD 2009»
15 years 4 months ago
Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
Su Yan, Hai Wang, Dongwon Lee, C. Lee Giles