Sciweavers

114 search results - page 8 / 23
» Nonlinear adaptive distance metric learning for clustering
Sort
View
IAT
2010
IEEE
13 years 5 months ago
An Interactive Tool for Constrained Clustering with Human Sampling
Abstract--This paper describes an interactive tool for constrained clustering that helps users to select effective constraints efficiently during the constrained clustering process...
Masayuki Okabe, Seiji Yamada
STACS
2007
Springer
14 years 1 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
CVPR
2003
IEEE
14 years 9 months ago
Joint Manifold Distance: a new approach to appearance based clustering
We wish to match sets of images to sets of images where both sets are undergoing various distortions such as viewpoint and lighting changes. To this end we have developed a Joint ...
Andrew W. Fitzgibbon, Andrew Zisserman
ICML
2004
IEEE
14 years 8 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
IJCAI
2007
13 years 9 months ago
Improving Embeddings by Flexible Exploitation of Side Information
Dimensionality reduction is a much-studied task in machine learning in which high-dimensional data is mapped, possibly via a non-linear transformation, onto a low-dimensional mani...
Ali Ghodsi, Dana F. Wilkinson, Finnegan Southey