Warning: Undefined variable $zfal in C:\Inetpub\vhosts\kidney.de\httpdocs\mlpefetch.php on line 525
Deprecated: str_replace(): Passing null to parameter #3 ($subject) of type array|string is deprecated in C:\Inetpub\vhosts\kidney.de\httpdocs\mlpefetch.php on line 525
Warning: Undefined variable $sterm in C:\Inetpub\vhosts\kidney.de\httpdocs\mlpefetch.php on line 530
 free
Warning: Undefined variable $sterm in C:\Inetpub\vhosts\kidney.de\httpdocs\mlpefetch.php on line 531
 free
 free
Warning: file_get_contents(http://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pubmed&id=18382603&cmd=llinks): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
in C:\Inetpub\vhosts\kidney.de\httpdocs\mlpefetch.php on line 445
 
English Wikipedia
Nephropedia Template TP (
Twit Text
DeepDyve
Pubget Overpricing |  
lüll
NML computation algorithms for tree-structured multinomial Bayesian networks Kontkanen P; Wettig H; Myllymaki PEURASIP J Bioinform Syst Biol 2007[]; 2007 (1): 90947Typical problems in bioinformatics involve large discrete datasets. Therefore, in order to apply statistical methods in such domains, it is important to develop efficient algorithms suitable for discrete data. The minimum description length (MDL) principle is a theoretically well-founded, general framework for performing statistical inference. The mathematical formalization of MDL is based on the normalized maximum likelihood (NML) distribution, which has several desirable theoretical properties. In the case of discrete data, straightforward computation of the NML distribution requires exponential time with respect to the sample size, since the definition involves a sum over all the possible data samples of a fixed size. In this paper, we first review some existing algorithms for efficient NML computation in the case of multinomial and naive Bayes model families. Then we proceed by extending these algorithms to more complex, tree-structured Bayesian networks.ä |
