Learning decomposable Markov networks in pseudo-independent domains with local evaluation (Q851873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: WEBWEAVR-III / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10994-006-8366-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000334459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bayesian method for the induction of probabilistic networks from data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating discrete probability distributions with dependence trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper Markov laws in the statistical analysis of decomposable graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4837254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of maximum likelihood in mixed graphical interaction models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Bayesian networks: The combination of knowledge and statistical data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling by shortest data description / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum likelihood bounded tree-width Markov networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Reasoning in Multiagent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ''microscopic'' study of minimum entropy search in learning decomposable Markov networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:38, 25 June 2024

scientific article
Language Label Description Also known as
English
Learning decomposable Markov networks in pseudo-independent domains with local evaluation
scientific article

    Statements

    Learning decomposable Markov networks in pseudo-independent domains with local evaluation (English)
    0 references
    0 references
    22 November 2006
    0 references
    0 references
    learning graphical models
    0 references
    knowledge discovery
    0 references
    decomposable Markov networks
    0 references
    local computation
    0 references
    probabilistic reasoning
    0 references
    0 references
    0 references
    0 references