Q4915354 (Q4915354): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An implementation of the iterative proportional fitting procedure by propagation trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of labeled k-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Multivariate Analysis Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximations to discrete probability distributions / 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: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating discrete probability distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating probability distributions to reduce storage requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: From conditional independences to factorization constraints with discrete random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3057242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4533364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovering a junction tree behind a Markov network by a greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogies between Multiplicative Models in Contingency Tables and Covariance Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Search among Multiplicative Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ''microscopic'' study of minimum entropy search in learning decomposable Markov networks / rank
 
Normal rank

Latest revision as of 09:07, 6 July 2024

scientific article; zbMATH DE number 6152602
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 6152602

    Statements

    10 April 2013
    0 references
    backward selection
    0 references
    information divergence
    0 references
    decomposable model
    0 references
    acyclic hypergraph
    0 references
    \(k\)-hypertree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references