69 search results - page 6 / 14 » Experimental Evaluation of the Greedy and Random Algorithms ... |
UAI
2003
13 years 8 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
RSA
2002
13 years 7 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...