[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: st: double hurble
Tirthankar Chakravarty <firstname.lastname@example.org>
Re: st: double hurble
Sat, 9 May 2009 21:25:33 +0100
The first line of my last post got eaten up:
On Sat, May 9, 2009 at 8:16 PM, Tirthankar Chakravarty
> 1) Note however that these are not double hurdle models for _count_
> data - where in my experience these are typically used (hurdle models
> are mixed outcome models with a binary first outcome for participation
> in an activity, and a truncated positive count outcome for amount of
> participation; double hurdle models are non-negative counts in the
> second outcome - entry with zero amount of participation is allowed):
> Recommended paper if you are interested in double hurdles.
> You can, very easily, fit independent double hurdle models in Stata:
> Replace -ztnb- with -nbreg- or any other univariate count regression command.
> 2) Of course if you only want (independent) hurdle models - which is
> typically the case - because it is count data, Joseph Hilbe has
> numerous routines to do this:
> ssc install hplogit
> ssc install hnbreg
> ssc install hgclg
> ssc install hglogit
> ssc install hnbclg
> 3) Dependent hurdle/double hurdle models are trickier; -gllamm-
> ssc install gllamm, replace
> is one possible solution. Writing your own -ml- routine is another. I
> don't think -cmp- (D. Roodman, SSC) supports count outcomes (?), else
> that would be ideal.
> 4) The code provided is for continuous outcomes.
> On Sat, May 9, 2009 at 5:47 PM, CHE, Yi <email@example.com> wrote:
>> Is there any stata code for double hurble model now?
>> Thank you very much!
>> Best Wishes
>> CHE, Yi
>> Mphil year 2
>> Division of Social Science
>> Hong Kong University of Science and Technology
>> * For searches and help try:
>> * http://www.stata.com/help.cgi?search
>> * http://www.stata.com/support/statalist/faq
>> * http://www.ats.ucla.edu/stat/stata/
> To every ω-consistent recursive class κ of formulae there correspond
> recursive class signs r, such that neither v Gen r nor Neg(v Gen r)
> belongs to Flg(κ) (where v is the free variable of r).
To every ω-consistent recursive class κ of formulae there correspond
recursive class signs r, such that neither v Gen r nor Neg(v Gen r)
belongs to Flg(κ) (where v is the free variable of r).
* For searches and help try: