Sciweavers

137 search results - page 9 / 28
» Ordinal Embedding: Approximation Algorithms and Dimensionali...
Sort
View
NIPS
2008
13 years 9 months ago
Supervised Exponential Family Principal Component Analysis via Convex Optimization
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
Yuhong Guo
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 5 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
BMVC
2010
13 years 5 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
ICML
2005
IEEE
14 years 8 months ago
Supervised dimensionality reduction using mixture models
Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We...
Sajama, Alon Orlitsky
ECCV
2004
Springer
14 years 9 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...