scholarly journals Quantification of pattern recognition quality by multivariate normal distribution functions

2008 ◽  
Vol 48 (3) ◽  
pp. 209-217
Author(s):  
P. Serapinas
Author(s):  
Michael J. Grayling ◽  
Adrian P. Mander

In this article, we present a set of commands and Mata functions to evaluate different distributional quantities of the multivariate normal distribution and a particular type of noncentral multivariate t distribution. Specifically, their densities, distribution functions, equicoordinate quantiles, and pseudo–random vectors can be computed efficiently, in either the absence or the presence of variable truncation.


2001 ◽  
Vol 33 (2) ◽  
pp. 437-452 ◽  
Author(s):  
József Bukszár

The problem of finding bounds for P(A1 ∪ ⋯ ∪ An) based on P(Ak1 ∩ ⋯ ∩ Aki) (1 ≤ k1 < ⋯ < ki ≤ n, i = 1,…,d) goes back to Boole (1854), (1868) and Bonferroni (1937). In this paper upper bounds are presented using methods in graph theory. The main theorem is a common generalization of the earlier results of Hunter, Worsley and recent results of Prékopa and the author. Algorithms are given to compute bounds. Examples for bounding values of multivariate normal distribution functions are presented.


Sign in / Sign up

Export Citation Format

Share Document