fortune candidate
Your example requires all choices of 1541 out of 3000, which I would expect to
take somewhere near age-of-the-universe seconds to compute. The code uses a
clever nested compuation due to Gail et al which will cut that time down to
infinity/10.
Sent from my iPhone
> On Jun
I'm traveling so chasing this down more fully will wait until I get home.
Four points.
1. This is an edge case. You will notice that if you add "subset=1:100" to the
coxph call that the function works perfectly. You have to get up to 1000 or so
before it fails.
2. The exact partial likeli
2 matches
Mail list logo
