142 search results - page 27 / 29 » Random Spanning Trees and the Prediction of Weighted Graphs |
135
click to vote
JMLR
2010
14 years 6 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...
110
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We propose a method that combines signals from many brain regions observed in functional Magnetic Resonance Imaging (fMRI) to predict the subject’s behavior during a scanning se...
102
click to vote
WEA
2007
Springer
15 years 5 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
123
Voted
BMCBI
2010
14 years 11 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
104
click to vote
AAAI
2011
13 years 11 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...