Sciweavers

COLT
2005
Springer
14 years 5 months ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed ā€œmanifold-motivatedā€...
Mikhail Belkin, Partha Niyogi
ICASSP
2008
IEEE
14 years 5 months ago
Graph laplacian for interactive image retrieval
Interactive image search or relevance feedback is the process which helps a user reļ¬ning his query and ļ¬nding difļ¬cult target categories. This consists in a step-by-step lab...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
GBRPR
2009
Springer
14 years 6 months ago
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
David Knossow, Avinash Sharma, Diana Mateus, Radu ...
ICPR
2006
IEEE
15 years 16 days ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
ICPR
2008
IEEE
15 years 19 days ago
Local Regularized Least-Square Dimensionality Reduction
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
Changshui Zhang, Yangqing Jia
CVPR
2008
IEEE
15 years 1 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...