2100 search results - page 179 / 420 » Learning to rank on graphs |
151
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...
190
click to vote
MM
2004
ACM
15 years 12 months ago
2004
ACM
In this paper, we propose a novel transductive learning framework named manifold-ranking based image retrieval (MRBIR). Given a query image, MRBIR first makes use of a manifold ra...
157
click to vote
JAIR
2000
15 years 6 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
182
click to vote
FOCI
2007
IEEE
16 years 26 days ago
2007
IEEE
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
204
click to vote
COLT
2004
Springer
15 years 12 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...