Sciweavers

110 search results - page 1 / 22
» Finding Generalized Projected Clusters In High Dimensional S...
Sort
View
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
14 years 1 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
APWEB
2006
Springer
14 years 1 months ago
Generalized Projected Clustering in High-Dimensional Data Streams
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
Ting Wang
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 9 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...
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 10 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
NN
2002
Springer
144views Neural Networks» more  NN 2002»
13 years 9 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