Sciweavers

114 search results - page 13 / 23
» Nonlinear adaptive distance metric learning for clustering
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
CICLING
2009
Springer
14 years 8 months ago
Semantic Clustering for a Functional Text Classification Task
Abstract. We describe a semantic clustering method designed to address shortcomings in the common bag-of-words document representation for functional semantic classification tasks....
Thomas Lippincott, Rebecca J. Passonneau
CVPR
2008
IEEE
14 years 9 months ago
Visual tracking via incremental Log-Euclidean Riemannian subspace learning
Recently, a novel Log-Euclidean Riemannian metric [28] is proposed for statistics on symmetric positive definite (SPD) matrices. Under this metric, distances and Riemannian means ...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...
IJON
2010
152views more  IJON 2010»
13 years 6 months ago
Adaptive local dissimilarity measures for discriminative dimension reduction of labeled data
Due to the tremendous increase of electronic information with respect to the size of data sets as well as their dimension, dimension reduction and visualization of high-dimensiona...
Kerstin Bunte, Barbara Hammer, Axel Wismüller...
CVPR
2008
IEEE
14 years 9 months ago
Clustering and dimensionality reduction on Riemannian manifolds
We propose a novel algorithm for clustering data sampled from multiple submanifolds of a Riemannian manifold. First, we learn a representation of the data using generalizations of...
Alvina Goh, René Vidal