384 search results - page 20 / 77 » Learning Markov Network Structure with Decision Trees |
ICANN
2010
Springer
13 years 9 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
IJAR
2006
13 years 8 months ago
2006
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...
BIRTHDAY
2008
Springer
13 years 10 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...