735 search results - page 104 / 147 » Supervised Graph Inference |
JMLR
2010
13 years 2 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Our paper has two main contributions. Firstly, it presents a model for image sequences motivated by an image encoding perspective. It models accreted regions, where objects appear...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...