Sciweavers

434 search results - page 4 / 87
» Dimensionality Reduction of Clustered Data Sets
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
14 years 11 days ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
14 years 1 months ago
A Discriminant Analysis for Undersampled Data
One of the inherent problems in pattern recognition is the undersampled data problem, also known as the curse of dimensionality reduction. In this paper a new algorithm called pai...
Matthew Robards, Junbin Gao, Philip Charlton
PRL
2006
77views more  PRL 2006»
13 years 7 months ago
Wavelet based approach to cluster analysis. Application on low dimensional data sets
In this paper, we present a wavelet based approach which tries to automatically find the number of clusters present in a data set, along with their position and statistical proper...
Xavier Otazu, Oriol Pujol
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 11 days ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos