No label defined (Q3979385)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 19874
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 19874

      Statements

      0 references
      26 June 1992
      0 references
      belief networks
      0 references
      hypergraph
      0 references
      updating
      0 references
      [For the entire collection see Zbl 0741.68004.] Updating belief networks is exponential in the number of nodes. All practical implementations therefore restrict updating to a small subset of the entire system. A systematic and coherent method therefore demands an optimal splitting of the network, a problem intrinsically \(NP\)-hard. The author represents the network as a hypergraph and introduces an algorithm that minimizes the total number of states, i.e., represents the total effort required for a full updating of a system on \(N\) states by a minimal sum \(\Sigma 2^{mi}\) where \(\Sigma m_ i=N\).
      0 references

      Identifiers