(-binomial n k)
A Java-callable wrapper around the 'binomial' function. Note that this wrapper silently coerces the result of the 'binomial' function from some type of integer to a Java double. It is not clear what happens when a BigInteger that is larger than can be held in a double is coerced.
A Java-callable wrapper around the 'binomial' function. Note that this wrapper silently coerces the result of the 'binomial' function from some type of integer to a Java double. It is not clear what happens when a BigInteger that is larger than can be held in a double is coerced.
(-binomialProbability trials events prob)
A Java-callable wrapper around the 'binomial-probability' function.
A Java-callable wrapper around the 'binomial-probability' function.
(-cumulativeBinomialProbability trials events prob)
A Java-callable wrapper around the 'cumulative-binomial-probability function.
A Java-callable wrapper around the 'cumulative-binomial-probability function.
(-main & args)
Just compares the time it takes to calculate a binomial via the binomial and binomial-from-distribution functions.
Just compares the time it takes to calculate a binomial via the binomial and binomial-from-distribution functions.
(-signTest trials events)
A Java-callable wrapper around the 'sign-test' function.
A Java-callable wrapper around the 'sign-test' function.
(binomial n k)
Calculate the binomial coefficient for the x^k term in the polynomial expansion of the binomial power (1 + x)^n (the mathematical definition from WikiPedia.) The function is also known as the 'choose' function and calculates the number of ways that 'k' things can be chosen from a pool of 'n' objects.
This function differs from the 'binomial-from-distribution' function in that it calculates the coefficient of interest directly rather than extracting it from the complete distribution. As such, it can be much faster, especially for large distributions.
Calculate the binomial coefficient for the x^k term in the polynomial expansion of the binomial power (1 + x)^n (the mathematical definition from WikiPedia.) The function is also known as the 'choose' function and calculates the number of ways that 'k' things can be chosen from a pool of 'n' objects. This function differs from the 'binomial-from-distribution' function in that it calculates the coefficient of interest directly rather than extracting it from the complete distribution. As such, it can be much faster, especially for large distributions.
(binomial-confidence-limits trials events conf)
Return the confidence limits for the number of successes in a number of Bernoulli trials at a specified confidence level.
Return the confidence limits for the number of successes in a number of Bernoulli trials at a specified confidence level.
(binomial-from-distribution n k)
Calculate the binomial coefficient. This implementation is derived from the bc function in finite_distributions.clj by Konrad Hinsen, which appears in the clojure-contrib library. It operates by first generating the entire list of binomial coefficients for a distribution of size n, then returns the (k + 1)th element of that list.
This function is not intended to be used in production. Rather, use the 'binomial' function, for which this serves as a check, since that function can be much faster.
Calculate the binomial coefficient. This implementation is derived from the bc function in finite_distributions.clj by Konrad Hinsen, which appears in the clojure-contrib library. It operates by first generating the entire list of binomial coefficients for a distribution of size n, then returns the (k + 1)th element of that list. This function is not intended to be used in production. Rather, use the 'binomial' function, for which this serves as a check, since that function can be much faster.
(binomial-probability trials events prob)
Calculate the probability of observing exactly 'events' successes in a series of 'trials' trials where each trial has a probability of 'prob' for success.
Calculate the probability of observing exactly 'events' successes in a series of 'trials' trials where each trial has a probability of 'prob' for success.
(cumulative-binomial-probability trials events prob)
(cumulative-binomial-probability trials lo-events hi-events prob)
Calculate and return the cumulative binomial probability of observing
a range of events
in a sequence of 'trials' Bernoulli trials, each
with a probability of 'prob' success.
The three argument version calculates the probability of 'events' or fewer successes.
The four argument version can be used to specify the lower and upper end of a range of 'events', such as 'x' or more, or from 'x' to 'y'.
In the case where the four argument version is invoked with identical arguments for the low and high end of the success range, the simple binomial probability is returned.
Calculate and return the cumulative binomial probability of observing a range of `events` in a sequence of 'trials' Bernoulli trials, each with a probability of 'prob' success. The three argument version calculates the probability of 'events' or fewer successes. The four argument version can be used to specify the lower and upper end of a range of 'events', such as 'x' or more, or from 'x' to 'y'. In the case where the four argument version is invoked with identical arguments for the low and high end of the success range, the simple binomial probability is returned.
(sign-test trials events)
Calculate the two-tailed probability of observing the given number of events above or below the hypothesized median of zero. The probability for a single tail of the sign test is the cumulative binomial probability for the same number of trials and events with a probability of 0.5 for each Bernoulli trial.
This function will only figure out the cumulative probability for the tail starting from zero (the low tail), then doubles it.
Calculate the two-tailed probability of observing the given number of events above or below the hypothesized median of zero. The probability for a single tail of the sign test is the cumulative binomial probability for the same number of trials and events with a probability of 0.5 for each Bernoulli trial. This function will only figure out the cumulative probability for the tail starting from zero (the low tail), then doubles it.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close