Metropolis Hastings Algorithm

In mathematics and physics, the Metropolis-Hastings algorithm is a Markov chain Monte Carlo method for creating a Markov chain that converges on a sequence of samples from a probability distribution that is difficult to sample from directly. This sequence can be used to approximate the distribution (i.e., to generate a histogram), or to compute an integral (such as an expected value).

Graphical Ontology Browser

  • Click on a node to jump to the content of that node
  • Pan to see the rest of the graph
  • Scroll the mousewheel up and down to zoom in and out
  • Rearrange the nodes in the graph by dragging a node to a different position

References

IntroductionPlanning/Decision ContextPlanning And Spatial Decision ProcessSpatial Planning And Decision Problem TypesMethods And Techniques
methods and techniques; methodology
TechnologyData And Domain KnowledgePeople And ParticipationResources