Search Results for ""
61 - 70 of 269 for Kruskal Wallis TestSearch Results
The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...
The probability that a statistical test will be positive for a true statistic.
The probability that a statistical test will be negative for a negative statistic.
A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...
A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...
A statistic defined to improve the Kolmogorov-Smirnov test in the tails.
A stable isolated (i.e., solitary) traveling nonlinear wave solution to a set of equations that obeys a superposition-like principle (i.e., solitons passing through one ...
The probability of getting a positive result for a given test which should produce a positive result.
The positive predictive value is the probability that a test gives a true result for a true statistic. The negative predictive value is the probability that a test gives a ...
A statistic defined to improve the Kolmogorov-Smirnov test in the tail of a distribution.
...
View search results from all Wolfram sites (10769 matches)

