2100 search results - page 105 / 420 » Learning to rank on graphs |
187
click to vote
RSA
2010
15 years 4 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
150
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
198
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
There has been much work on applying multiple-instance (MI) learning to contentbased image retrieval (CBIR) where the goal is to rank all images in a known repository using a smal...
177
click to vote
DAM
2010
15 years 6 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
162
click to vote
IIR
2010
15 years 7 months ago
2010
Given a classifier trained on relatively few training examples, active learning (AL) consists in ranking a set of unlabeled examples in terms of how informative they would be, if ...