240 search results - page 3 / 48 » Laplacian Spectrum Learning |
IJON
2010
13 years 3 months ago
2010
This paper presents varifold learning, a learning framework based on the mathematical concept of varifolds. Different from manifold based methods, our varifold learning framework ...
ICPR
2006
IEEE
14 years 5 months ago
2006
IEEE
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...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
The aim of transfer learning is to accelerate learning in related domains. In reinforcement learning, many different features such as a value function and a policy can be transfer...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...