Skip to content
#

probability

Here are 99 public repositories matching this topic...

Ultimate-Notes-Books-Resources-for-NCIT
Predictions-with-Markov-Chains

Predictions with Markov Chains is a JS application that multiplies a probability vector with a transition matrix multiple times (n steps - user defined). On each step, the values from the resulting probability vectors are plotted on a chart. The resulting curves on the chart indicate the behavior of the system over n steps.

  • Updated Mar 21, 2022
  • HTML
Discrete-Probability-Detector-JS

Discrete Probability Detector (DPD) application uses an algorithm that transforms any sequence of symbols into a transition matrix. It is able to detect the number of states from the sequence and calculate the transition probabilities between these states. This version of DPD is made in JavaScript.

  • Updated Mar 21, 2022
  • HTML
Markov-Chains-scanner

The current JS application is a detector that uses observation sequences to construct the transition matrices for two models, which are merged into a single log-likelihood matrix (LLM). A scanner can use this LLM to search for regions of interest inside a longer sequence called z (the target).

  • Updated Mar 21, 2022
  • HTML
Discrete-Probability-Detector

These implementations make use of an algorithm called DPD (Discrete Probability Detector), that transforms any sequence of symbols into a transition matrix. DPD is able to detect the number of states from the sequence and calculate the transition probabilities between these states. This version of DPD is made in JavaScript, VBS and VB6.

  • Updated Mar 21, 2022
  • HTML

Improve this page

Add a description, image, and links to the probability topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the probability topic, visit your repo's landing page and select "manage topics."

Learn more