139 search results - page 23 / 28 » Learning Bayesian Network Structure using LP Relaxations |
UAI
2001
14 years 11 months ago
2001
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
The use of domain knowledge in a learner can greatly improve the models it produces. However, high-quality expert knowledge is very difficult to obtain. Traditionally, researchers...
JETAI
1998
14 years 9 months ago
1998
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
109
Voted
MST
2010
14 years 4 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...