1301 search results - page 70 / 261 » Default Clustering from Sparse Data Sets |
CVPR
2004
IEEE
14 years 11 months ago
2004
IEEE
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
VLDB
1998
ACM
14 years 1 months ago
1998
ACM
Wedescribea novel approachfor clustering collectionsof sets,andits applicationto theanalysis and mining of categoricaldata. By "categorical data," we meantableswith fiel...
SIGMOD
2000
ACM
14 years 1 months ago
2000
ACM
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...
APVIS
2010
13 years 10 months ago
2010
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
ICIAR
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we introduce a new multiscale representation for 2-D images named the Inter-Coefficient Product (ICP). The ICP is a decimated pyramid of complex values based on the ...