Re: [Gretl-users] ordered probit bug (was Re: Copy of Data File)
On Wed, 6 Aug 2008, Allin Cottrell wrote:
The ordered probit code in gretl is predicated on the assumption
that the values of the dependent variable are drawn from, and
exhaust, a continuous set of integer levels or rankings, usually
{1,2,3,...,n} or {0,1,2,3,..,n}.
The levels don't have to be zero-based, but there can be no
skipped values.
That constraint is now relaxed. If the above condition is not
met, we create an internal transformation of the dependent
variable that satisfies the condition. So there can be gaps, and
also non-integer values (but in the latter case the dependent
variable will be rejected unless it has been marked as discrete).
Allin.