排序方式: 共有69条查询结果,搜索用时 15 毫秒
11.
Katarzyna Budny 《统计学通讯:理论与方法》2013,42(17):5220-5223
ABSTRACTWe extend Chebyshev's inequality to a random vector with a singular covariance matrix. Then we consider the case of a multivariate normal distribution for this generalization. 相似文献
12.
AbstractWe introduce here the truncated version of the unified skew-normal (SUN) distributions. By considering a special truncations for both univariate and multivariate cases, we derive the joint distribution of consecutive order statistics X(r, ..., r + k) = (X(r), ..., X(r + K))T from an exchangeable n-dimensional normal random vector X. Further we show that the conditional distributions of X(r + j, ..., r + k) given X(r, ..., r + j ? 1), X(r, ..., r + k) given (X(r) > t)?and X(r, ..., r + k) given (X(r + k) < t) are special types of singular SUN distributions. We use these results to determine some measures in the reliability theory such as the mean past life (MPL) function and mean residual life (MRL) function. 相似文献
13.
Esteban Walker 《统计学通讯:理论与方法》2013,42(5):1675-1690
14.
Yan Yin 《湖南文理学院学报(社会科学版)》1999,(3)
提出了回归分析中异性方差的检验和对估计结果带来的影响以及消除其异方差性的两种方法:对原模型进行变换和加权最小二乘法. 相似文献
15.
《Journal of Statistical Computation and Simulation》2012,82(3):219-253
This paper describes two new, mathematical programming-based approaches for evaluating general, one- and two-sidedp-variate normal probabilities where the variance-covariance matrix (of arbitrary structure) is singular with rankr(r<pand r and p can be of unlimited dimensions. In both cases, principal components are used to transform the original, ill-definedp-dimensional integral into a well-definedrdimensional integral over a convex polyhedron. The first algorithm that is presented uses linear programming coupled with a Gauss-Legendre quadrature scheme to compute this integral, while the second algorithm uses multi-parametric programming techniques in order to significantly reduce the number of optimization problems that need to be solved. The application of the algorithms is demonstrated and aspects of computational performance are discussed through a number of examples, ranging from a practical problem that arises in chemical engineering to larger, numerical examples. 相似文献
16.
17.
18.
The construction of kernel discriminant coordinates reduces to the solution of a generalized eigenvalue problem in which both matrices are nonnegative definite. Six different algorithms for solving that problem are described, and the performance of these algorithms is tested on 26 different datasets. The percentage of misclassifications using a linear discriminant function is noted, and the algorithms’ running times are ascertained. Classification is also performed in the space of classical discriminant coordinates. 相似文献
19.
Philipp Auer 《统计学通讯:模拟与计算》2013,42(5):962-977
This article approaches the problem of selecting significant principal components from a Bayesian model selection perspective. The resulting Bayes rule provides a simple graphical technique that can be used instead of (or together with) the popular scree plot to determine the number of significant components to retain. We study the theoretical properties of the new method and show, by examples and simulation, that it provides more clear-cut answers than the scree plot in many interesting situations. 相似文献
20.
We describe a class of bivariate distributions whose marginals are uniform on the unit interval. Such distributions are often called “copulas.” The particular copulas we present are especially well suited for use in undergraduate mathematical statistics courses, as many of their basic properties can be derived using elementary calculus. In particular, we show how these copulas can be used to illustrate the existence of distributions with singular components and to give a geometric interpretation to Kendall's tau. 相似文献