65 resultados para Ordered probit regression


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Postestimation processing and formatting of regression estimates for input into document tables are tasks that many of us have to do. However, processing results by hand can be laborious, and is vulnerable to error. There are therefore many benefits to automation of these tasks while at the same time retaining user flexibility in terms of output format. The estout package meets these needs. estout assembles a table of coefficients, "significance stars", summary statistics, standard errors, t/z statistics, p-values, confidence intervals, and other statistics calculated for up to twenty models previously fitted and stored by estimates store. It then writes the table to the Stata log and/or to a text file. The estimates are formatted optionally in several styles: html, LaTeX, or tab-delimited (for input into MS Excel or Word). There are a large number of options regarding which output is formatted and how. This talk will take users through a range of examples, from relatively basic simple applications to complex ones.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

logitcprplot can be used after logistic regression for graphing a component-plus-residual plot (a.k.a. partial residual plot) for a given predictor, including a lowess, local polynomial, restricted cubic spline, fractional polynomial, penalized spline, regression spline, running line, or adaptive variable span running line smooth

Relevância:

20.00% 20.00%

Publicador:

Resumo:

rrlogit fits a maximum-likelihood logistic regression for randomized response data.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

wgttest performs a test proposed by DuMouchel and Duncan (1983) to evaluate whether the weighted and unweighted estimates of a regression model are significantly different.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Proof-theoretic methods are developed and exploited to establish properties of the variety of lattice-ordered groups. In particular, a hypersequent calculus with a cut rule is used to provide an alternative syntactic proof of the generation of the variety by the lattice-ordered group of automorphisms of the real number chain. Completeness is also established for an analytic (cut-free) hypersequent calculus using cut elimination and it is proved that the equational theory of the variety is co-NP complete.