1285 search results - page 71 / 257 » On the Complexity of Ordinal Clustering |
DCC
2009
IEEE
14 years 9 months ago
2009
IEEE
The RKLT is a lossless approximation to the KLT, and has been recently employed for progressive lossy-to-lossless coding of hyperspectral images. Both yield very good coding perfo...
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
ALT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
BPM
2009
Springer
14 years 3 months ago
2009
Springer
The goal of process mining is to discover process models from event logs. However, for processes that are not well structured and have a lot of diverse behavior, existing process m...
CVPR
2000
IEEE
14 years 1 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...