Results 1  10
of
2,668
Maximum Likelihood Phylogenetic Estimation from DNA Sequences with Variable Rates over Sites: Approximate Methods
 J. Mol. Evol
, 1994
"... Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called ..."
Abstract

Cited by 557 (29 self)
 Add to MetaCart
Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called
Parameter estimation of the hybrid censored lognormal distribution
 Journal of Statistical Computation and Simulation
, 2011
"... The two most common censoring schemes used in life testing experiments are TypeI and TypeII censoring schemes. Hybrid censoring scheme is mixture of TypeI and TypeII censoring scheme. In this work we consider the estimation of parameters of lognormal distribution based on hybrid censored data. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. The parameters are estimated by the maximum likelihood method. It is observed that the maximum likelihood estimates can not be obtained in closed form. We obtain the maximum likelihood estimates of the unknown parameters using EM algorithm. We also propose approximate maximum likelihood estimates and these can
Approximating discrete probability distributions with dependence trees
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1968
"... A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n variables ..."
Abstract

Cited by 881 (0 self)
 Add to MetaCart
variables. It is shown that the procedure derived in this paper yields an approximation of a minimum difference in information. It is further shown that when this procedure is applied to empirical observations from an unknown distribution of tree dependence, the procedure is the maximumlikelihood estimate
MIXED MNL MODELS FOR DISCRETE RESPONSE
 JOURNAL OF APPLIED ECONOMETRICS J. APPL. ECON. 15: 447470 (2000)
, 2000
"... This paper considers mixed, or random coefficients, multinomial logit (MMNL) models for discrete response, and establishes the following results. Under mild regularity conditions, any discrete choice model derived from random utility maximization has choice probabilities that can be approximated as ..."
Abstract

Cited by 487 (15 self)
 Add to MetaCart
as closely as one pleases by a MMNL model. Practical estimation of a parametric mixing family can be carried out by Maximum Simulated Likelihood Estimation or Method of Simulated Moments, and easily computed instruments are provided that make the latter procedure fairly efficient. The adequacy of a mixing
Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2008
"... We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added ℓ1norm penalty term. The problem as formulated is convex but the memor ..."
Abstract

Cited by 334 (2 self)
 Add to MetaCart
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added ℓ1norm penalty term. The problem as formulated is convex
Approximate likelihood ratio test for branches: a fast, accurate and powerful alternative
 SYSTEMATIC BIOLOGY
, 2006
"... We revisit statistical tests for branches of evolutionary trees reconstructed upon molecular data. A new, fast, approximate likelihoodratio test (aLRT) for branches is presented here as a competitive alternative to nonparametric bootstrap and Bayesian estimation of branch support. The aLRT is based ..."
Abstract

Cited by 275 (9 self)
 Add to MetaCart
We revisit statistical tests for branches of evolutionary trees reconstructed upon molecular data. A new, fast, approximate likelihoodratio test (aLRT) for branches is presented here as a competitive alternative to nonparametric bootstrap and Bayesian estimation of branch support. The a
Numerical Distribution Functions of Likelihood Ratio Tests for Cointegration
 Journal of Applied Econometrics
, 1999
"... This paper employs response surface regressions based on simulation experiments to calculate asymptotic distribution functions for the Johansentype likelihood ratio tests for cointegration. These are carried out in the context of the models recently proposed by Pesaran, Shin, and Smith (1997) that ..."
Abstract

Cited by 299 (11 self)
 Add to MetaCart
This paper employs response surface regressions based on simulation experiments to calculate asymptotic distribution functions for the Johansentype likelihood ratio tests for cointegration. These are carried out in the context of the models recently proposed by Pesaran, Shin, and Smith (1997
Blind separation of speech mixtures via timefrequency masking
 IEEE TRANSACTIONS ON SIGNAL PROCESSING (2002) SUBMITTED
, 2004
"... Binary timefrequency masks are powerful tools for the separation of sources from a single mixture. Perfect demixing via binary timefrequency masks is possible provided the timefrequency representations of the sources do not overlap: a condition we calldisjoint orthogonality. We introduce here t ..."
Abstract

Cited by 322 (5 self)
 Add to MetaCart
one mixture. While determining these masks blindly from just one mixture is an open problem, we show that we can approximate the ideal masks in the case where two anechoic mixtures are provided. Motivated by the maximum likelihood mixing parameter estimators, we define a power weighted two
Minimum complexity density estimation
 IEEE TRANS. INF. THEORY
, 1991
"... The minimum complexity or minimum descriptionlength criterion developed by Kolmogorov, Rissanen, Wallace, So&in, and others leads to consistent probability density estimators. These density estimators are defined to achieve the best compromise between likelihood and simplicity. A related issue ..."
Abstract

Cited by 247 (8 self)
 Add to MetaCart
The minimum complexity or minimum descriptionlength criterion developed by Kolmogorov, Rissanen, Wallace, So&in, and others leads to consistent probability density estimators. These density estimators are defined to achieve the best compromise between likelihood and simplicity. A related issue
Likelihoodbased tests of topologies in phylogenetics. Syst. Biol
, 2000
"... Abstract.—Likelihoodbased statistical tests of competing evolutionary hypotheses (tree topologies) have been available for approximately a decade. By far the most commonly used is the Kishino–Hasegawa test. However, the assumptions that have to be made to ensure the validity of the Kishino–Hasegawa ..."
Abstract

Cited by 225 (3 self)
 Add to MetaCart
contentions. [Kishino– Hasegawa test; maximum likelihood; phylogeny; Shimodaira–Hasegawa test; statistical tests; tree topology.] Hasegawa and Kishino (1989) and Kishino and Hasegawa(1989)developed methods for estimating the standard error and con�dence intervals for the difference in loglikelihoods between
Results 1  10
of
2,668