Sciweavers

2033 search results - page 25 / 407
» Ranking on Data Manifolds
Sort
View
TSMC
2010
13 years 2 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ECML
2007
Springer
14 years 1 months ago
An Unsupervised Learning Algorithm for Rank Aggregation
Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as op...
Alexandre Klementiev, Dan Roth, Kevin Small
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
NIPS
2007
13 years 9 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
DAGSTUHL
2009
13 years 8 months ago
Learning Highly Structured Manifolds: Harnessing the Power of SOMs
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
Erzsébet Merényi, Kadim Tasdemir, Li...