Spelling suggestions: "subject:"asdistribution (probability theory)."" "subject:"asdistribution (aprobability theory).""
81 |
Measuring the degree of dependence of lifetimes in some bivariate survival distributionsPoon, Shing-Tat. January 1993 (has links)
Thesis (M.Soc.Sc.)--University of Hong Kong, 1993. / Includes bibliographical references (leaf 33) Also available in print.
|
82 |
Extremal dependence of multivariate distributions and its applicationsSun, Yannan. January 2010 (has links) (PDF)
Thesis (Ph. D.)--Washington State University, May 2010. / Title from PDF title page (viewed on June 30, 2010). "Department of Mathematics." Includes bibliographical references (p. 61-65).
|
83 |
The distribution of the likelihood ratio criterion for testing hypotheses regarding covariance matrices /Chaput, Luc. January 1969 (has links)
No description available.
|
84 |
On the central limit theorems.Retek, Marietta January 1971 (has links)
No description available.
|
85 |
Distribution asymptotique des statistiques de Kolmogorov pour un enchantillonPouliot, Dominique January 1979 (has links)
No description available.
|
86 |
On the limit distributions of high level crossings by a stationary processBélisle, Claude January 1981 (has links)
No description available.
|
87 |
The exact distribution of Kolmogorov's statistic D(n) for n less than or equal to 12 /Gambino, Gioacchino. January 1979 (has links)
No description available.
|
88 |
Characterizations of univariate and multivariate distributions using regression propertiesGordon, Florence S. January 1967 (has links)
No description available.
|
89 |
Determination of the distribution of sample sizes required in time studyPoola, Jagadeesan V. January 1963 (has links)
Call number: LD2668 .T4 1963 P65 / Master of Science
|
90 |
Autonomous learning of domain models from probability distribution clustersSłowiński, Witold January 2014 (has links)
Nontrivial domains can be difficult to understand and the task of encoding a model of such a domain can be difficult for a human expert, which is one of the fundamental problems of knowledge acquisition. Model learning provides a way to address this problem by allowing a predictive model of the domain's dynamics to be learnt algorithmically, without human supervision. Such models can provide insight about the domain to a human or aid in automated planning or reinforcement learning. This dissertation addresses the problem of how to learn a model of a continuous, dynamic domain, from sensory observations, through the discretisation of its continuous state space. The learning process is unsupervised in that there are no predefined goals, and it assumes no prior knowledge of the environment. Its outcome is a model consisting of a set of predictive cause-and-effect rules which describe changes in related variables over brief periods of time. We present a novel method for learning such a model, which is centred around the idea of discretising the state space by identifying clusters of uniform density in the probability density function of variables, which correspond to meaningful features of the state space. We show that using this method it is possible to learn models exhibiting predictive power. Secondly, we show that applying this discretisation process to two-dimensional vector variables in addition to scalar variables yields a better model than only applying it to scalar variables and we describe novel algorithms and data structures for discretising one- and two-dimensional spaces from observations. Finally, we demonstrate that this method can be useful for planning or decision making in some domains where the state space exhibits stable regions of high probability and transitional regions of lesser probability. We provide evidence for these claims by evaluating the model learning algorithm in two dynamic, continuous domains involving simulated physics: the OpenArena computer game and a two-dimensional simulation of a bouncing ball falling onto uneven terrain.
|
Page generated in 0.1698 seconds