2100 search results - page 110 / 420 » Learning to rank on graphs |
167
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper, we formulate the shape localization problem in the Bayesian framework. In the learning stage, we propose the Constrained RankBoost approach to model the likelihood ...
170
click to vote
NIPS
2004
15 years 7 months ago
2004
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
161
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
197
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
188
click to vote
DOCENG
2006
ACM
16 years 11 days ago
2006
ACM
Category ranking provides a way to classify plain text documents into a pre-determined set of categories. This work proposes to have a look at typical document collections and ana...