298 search results - page 12 / 60 » Subspace Clustering of High Dimensional Data |
121
Voted
SDM
2003
SIAM
15 years 1 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
110
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
105
click to vote
ICDM
2002
IEEE
15 years 5 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
104
click to vote
DIS
2006
Springer
15 years 4 months ago
2006
Springer
Parametric Embedding (PE) has recently been proposed as a general-purpose algorithm for class visualisation. It takes class posteriors produced by a mixture-based clustering algori...
SIAMSC
2008
15 years 10 days ago
2008
Coding of data, usually upstream of data analysis, has crucial implications for the data analysis results. By modifying the data coding