Sciweavers

114 search results - page 2 / 23
» OP-Cluster: Clustering by Tendency in High Dimensional Space
Sort
View
PAKDD
2009
ACM
186views Data Mining» more  PAKDD 2009»
13 years 11 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
TKDE
2002
124views more  TKDE 2002»
13 years 4 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...
NN
2002
Springer
144views Neural Networks» more  NN 2002»
13 years 4 months ago
Projective ART for clustering data sets in high dimensional spaces
A new neural network architecture (PART) and the resulting algorithm are proposed to
Yongqiang Cao, Jianhong Wu
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 4 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...