103 search results - page 13 / 21 » Projective ART for clustering data sets in high dimensional ... |
KDD
2007
ACM
14 years 7 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
MICCAI
2005
Springer
14 years 8 months ago
2005
Springer
In this paper, we propose a new approach to detect activated time series in functional MRI using support vector clustering (SVC). We extract Fourier coefficients as the features of...
MM
2005
ACM
14 years 29 days 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...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
PAMI
2011
13 years 2 months ago
2011
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...