741 search results - page 79 / 149 » A Markov random field model for term dependencies |
143
click to vote
CIKM
2009
Springer
16 years 26 days ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
160
click to vote
AAAI
2011
14 years 6 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
165
click to vote
NIPS
2004
15 years 7 months ago
2004
Coreference analysis, also known as record linkage or identity uncertainty, is a difficult and important problem in natural language processing, databases, citation matching and m...
135
click to vote
UAI
2004
15 years 7 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
178
click to vote
UAI
2004
15 years 7 months ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...