184 search results - page 11 / 37 » Random Projection for High Dimensional Data Clustering: A Cl... |
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...