Probability matrices, non-negative rank, and parameterization of mixture models
نویسندگان
چکیده
منابع مشابه
Using Regression based Control Limits and Probability Mixture Models for Monitoring Customer Behavior
In order to achieve the maximum flexibility in adaptation to ever changing customer’s expectations in customer relationship management, appropriate measures of customer behavior should be continually monitored. To this end, control charts adjusted for buyer’s/visitor’s prior intention to repurchase or visit again are suitable means taking into account the heterogeneity across customers. In the ...
متن کاملCure Fraction Models Using Mixture and Non-mixture Models
We introduce the Weibull distributions in presence of cure fraction, censored data and covariates. Twomodels are explored in this paper: mixture and non-mixture models. Inferences for the proposed models are obtained under the Bayesian approach, using standard MCMC (Markov Chain Monte Carlo) methods. An illustration of the proposed methodology is given considering a lifetime data set.
متن کاملEnhanced position weight matrices using mixture models
MOTIVATION Positional weight matrix (PWM) is derived from a set of experimentally determined binding sites. Here we explore whether there exist subclasses of binding sites and if the mixture of these subclass-PWMs can improve the binding site prediction. Intuitively, the subclasses correspond to either distinct binding preference of the same transcription factor in different contexts or distinc...
متن کاملOn Non-negative-valued Matrices.
cording to our Theorem, if (4) is fulfilled, f3 and a can be so chosen that (2) be fulfilled. This form shows, however, that the lowest term in the determinant Ioua'+ Owa-11, if considered as a polynomial in E, is {nT Hence, the lowest term in the determinant :u ± EWI is I0K-1Iaean-r, i.e., the coefficient of (n7r in the determinant |u + Ew| does not vanish. Conversely, let us assume that u and...
متن کاملThe Geometry of the EM Algorithm for Matrices with Non-negative Rank Constraints
Abstract. The maximum likelihood estimation problem for matrices with bounded rank was studied in [1]. The study used numerical algebraic geometry to find the number of critical points of the likelihood function on the algebraic closure Vr of all complex matrices with rank less than or equal to r. In this paper we apply the EM algorithm to solve the maximum likelihood estimation problem for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.03.010