|
Volumn 4162 LNCS, Issue , 2006, Pages 305-314
|
Learning Bayesian networks does not have to be NP-hard
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTER SCIENCE;
DATA REDUCTION;
GRAPH THEORY;
RANDOM PROCESSES;
BAYESIAN NETWORKS;
BAYESIAN-DIRICHLET EQUIVALENCE;
MINIMAL DESCRIPTION LENGTH;
LEARNING SYSTEMS;
|
EID: 33750057957
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/11821069_27 Document Type: Conference Paper |
Times cited : (33)
|
References (10)
|