Sciweavers

66 search results - page 6 / 14
» The Elastic Embedding Algorithm for Dimensionality Reduction
Sort
View
ECCV
2004
Springer
16 years 1 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...
95
Voted
IJON
2010
121views more  IJON 2010»
14 years 9 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen
AAAI
2010
15 years 1 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
92
Voted
BIOWIRE
2007
Springer
15 years 5 months ago
Beta Random Projection
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. In particular, r...
Yu-En Lu, Pietro Liò, Steven Hand
AAAI
2010
14 years 8 months ago
Multilinear Maximum Distance Embedding Via L1-Norm Optimization
Dimensionality reduction plays an important role in many machine learning and pattern recognition tasks. In this paper, we present a novel dimensionality reduction algorithm calle...
Yang Liu, Yan Liu, Keith C. C. Chan