39 citations · 122 across the 7 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.AI2012★ 3 cited
Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical Models
Chris Bartels, Jeff A. Bilmes
We observe that certain large-clique graph triangulations can be useful to reduce both computational and space requirements when making queries on mixed stochastic/deterministic gr…
cs.LG2012★ 37 cited
Consensus ranking under the exponential model
Marina Meila, Kapil Phadnis, Arthur Patterson +1
We analyze the generalized Mallows model, a popular exponential model over rankings. Estimating the central (or consensus) ranking from data is NP-hard. We obtain the following new…
cs.LG2012★ 34 cited
Active Semi-Supervised Learning using Submodular Functions
Andrew Guillory, Jeff A. Bilmes
We consider active, semi-supervised learning in an offline transductive setting. We show that a previously proposed error bound for active learning on undirected weighted graphs ca…