Search results for "Conditional probability distribution"
showing 10 items of 23 documents
Response models for mixed binary and quantitative variables
1992
SUMMARY A number of special representations are considered for the joint distribution of qualitative, mostly binary, and quantitative variables. In addition to the conditional Gaussian models and to conditional Gaussian regression chain models some emphasis is placed on models derived from an underlying multivariate normal distribution and on models in which discrete probabilities are specified linearly in terms of unknown parameters. The possibilities for choosing between the models empirically are examined, as well as the testing of independence and conditional independence and the estimation of parameters. Often the testing of independence is exactly or nearly the same for a number of di…
A Unified Approach to Likelihood Inference on Stochastic Orderings in a Nonparametric Context
1998
Abstract For data in a two-way contingency table with ordered margins, we consider various hypotheses of stochastic orders among the conditional distributions considered by rows and show that each is equivalent to requiring that an invertible transformation of the vectors of conditional row probabilities satisfies an appropriate set of linear inequalities. This leads to the construction of a general algorithm for maximum likelihood estimation under multinomial sampling and provides a simple framework for deriving the asymptotic distribution of log-likelihood ratio tests. The usual stochastic ordering and the so called uniform and likelihood ratio orderings are considered as special cases. I…
Recursive estimation of the conditional geometric median in Hilbert spaces
2012
International audience; A recursive estimator of the conditional geometric median in Hilbert spaces is studied. It is based on a stochastic gradient algorithm whose aim is to minimize a weighted L1 criterion and is consequently well adapted for robust online estimation. The weights are controlled by a kernel function and an associated bandwidth. Almost sure convergence and L2 rates of convergence are proved under general conditions on the conditional distribution as well as the sequence of descent steps of the algorithm and the sequence of bandwidths. Asymptotic normality is also proved for the averaged version of the algorithm with an optimal rate of convergence. A simulation study confirm…
Pairwise Markov properties for regression graphs
2016
With a sequence of regressions, one may generate joint probability distributions. One starts with a joint, marginal distribution of context variables having possibly a concentration graph structure and continues with an ordered sequence of conditional distributions, named regressions in joint responses. The involved random variables may be discrete, continuous or of both types. Such a generating process specifies for each response a conditioning set that contains just its regressor variables, and it leads to at least one valid ordering of all nodes in the corresponding regression graph that has three types of edge: one for undirected dependences among context variables, another for undirect…
MCMC methods to approximate conditional predictive distributions
2006
Sampling from conditional distributions is a problem often encountered in statistics when inferences are based on conditional distributions which are not of closed-form. Several Markov chain Monte Carlo (MCMC) algorithms to simulate from them are proposed. Potential problems are pointed out and some suitable modifications are suggested. Approximations based on conditioning sets are also explored. The issues are illustrated within a specific statistical tool for Bayesian model checking, and compared in an example. An example in frequentist conditional testing is also given.
Exploring regression structure with graphics
1993
We investigate the extent to which it may be possible to carry out a regression analysis using graphics alone, an idea that we refer to asgraphical regression. The limitations of this idea are explored. It is shown that graphical regression is theoretically possible with essentially no constraints on the conditional distribution of the response given the predictors, but with some conditions on marginal distribution of the predictors. Dimension reduction subspaces and added variable plots play a central role in the development. The possibility of useful methodology is explored through two examples.
On decoupling in Banach spaces
2021
AbstractWe consider decoupling inequalities for random variables taking values in a Banach space X. We restrict the class of distributions that appear as conditional distributions while decoupling and show that each adapted process can be approximated by a Haar-type expansion in which only the pre-specified conditional distributions appear. Moreover, we show that in our framework a progressive enlargement of the underlying filtration does not affect the decoupling properties (in particular, it does not affect the constants involved). As a special case, we deal with one-sided moment inequalities for decoupled dyadic (i.e., Paley–Walsh) martingales and show that Burkholder–Davis–Gundy-type in…
Parameter orthogonality and conditional profile likelihood: the exponential power function case
1999
Orthogonality, according to Fisher’s metrics, between the parameters of a probability density function, as well as giving rise to a series of statistical implications, makes it possible to express a function of conditional profile likelihood with better properties than the ordinary profile likelihood function. In the present paper the parameters of exponential power function are made orthogonal and the conditional profile likelihood of the shape parameter p is determined in order to study its properties with reference to p estimation. Moreover, by means of a simulation plan, a comparison is made between the estimates of p obtained from the conditional profile log-likelihood and those obtain…
Modeling user preferences in content-based image retrieval: A novel attempt to bridge the semantic gap
2015
This paper is concerned with content-based image retrieval from a stochastic point of view. The semantic gap problem is addressed in two ways. First, a dimensional reduction is applied using the (pre-calculated) distances among images. The dimension of the reduced vector is the number of preferences that we allow the user to choose from, in this case, three levels. Second, the conditional probability distribution of the random user preference, given this reduced feature vector, is modeled using a proportional odds model. A new model is fitted at each iteration. The score used to rank the image database is based on the estimated probability function of the random preference. Additionally, so…
A principled approach to network-based classification and data representation
2013
Measures of similarity are fundamental in pattern recognition and data mining. Typically the Euclidean metric is used in this context, weighting all variables equally and therefore assuming equal relevance, which is very rare in real applications. In contrast, given an estimate of a conditional density function, the Fisher information calculated in primary data space implicitly measures the relevance of variables in a principled way by reference to auxiliary data such as class labels. This paper proposes a framework that uses a distance metric based on Fisher information to construct similarity networks that achieve a more informative and principled representation of data. The framework ena…