184 search results - page 16 / 37 » Random Projection for High Dimensional Data Clustering: A Cl... |
VISSYM
2003
13 years 10 months ago
2003
Traditional visualization techniques for multidimensional data sets, such as parallel coordinates, glyphs, and scatterplot matrices, do not scale well to high numbers of dimension...
SDM
2004
SIAM
13 years 10 months ago
2004
SIAM
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
MM
2005
ACM
14 years 2 months ago
2005
ACM
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
MMM
2011
Springer
13 years 9 days ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...