114 search results - page 19 / 23 » Nonlinear adaptive distance metric learning for clustering |
CPM
2000
Springer
13 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
We present a Dynamic Data Driven Application System (DDDAS) to track 2D shapes across large pose variations by learning non-linear shape manifold as overlapping, piecewise linear s...
ESANN
2006
13 years 8 months ago
2006
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
DMIN
2006
13 years 8 months ago
2006
We present an application of bi-dimensional and heterogeneous time series clustering in order to resolve a Social Sciences issue. The dataset is the result of a survey involving mo...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper we predict the amount of slip an exploration rover would experience using stereo imagery by learning from previous examples of traversing similar terrain. To do t...