Daniel Quinlan wrote:
There are other slow rules. Language guessing, for example.

Yes, language guessing is slow and I've yet to find a way to speed it up after the first optimization I did on it. It's a Bayesian calculation much like the Bayes classifier. But are there any others? Also, do we get good enough results from the language classifier for it to be worthwhile?


I'm under the impression that Bayes is in a class by itself in terms of how slow and how useful it is.

ways to make message checks more efficient in general (early exit is
one option if it actually speeds things up)

Well, if we get early exit, that would take care this, if Bayes was scheduled last.


That does bring to mind a complication with early exit and Bayes: Doesn't early exit imply running all negative rules first? But Bayes has both positive and negative rules coming out of the calculation. So something would have to be done to treat Bayes as a special case.

if we did decision tree, but only to determine whether or not
all rules would be evaluated?

I don't understand how this would work. Rules mostly don't depend on each other, so how do you form the decision tree other than evaluating the highest score rules first and bailing out when subsequent scores can't make a difference in results, i.e., short-circuiting?


 -- sidney



Reply via email to