Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.ai    |    Awaiting the gospel from Sarah Connor    |    1,954 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 698 of 1,954    |
|    Dmitry A. Kazakov to Ted Dunning    |
|    Re: Decision Trees    |
|    09 Apr 05 23:02:08    |
      From: mailbox@dmitry-kazakov.de              On Fri, 08 Apr 2005 19:13:53 GMT, Ted Dunning wrote:              > What       > normal decision trees are particularly good at is learning decision       > surfaces that are largely parallel to the feature axes.              [ Another important advantage is that decision trees tolerate inseparable       classes in which case they just cluster the feature space in *some* way. ]              > What linear       > classifier techniques are good at is learning linearly separable       > surfaces in any orientation whatsoever. Depending on your problem,       > you might be able to project into an interesting higher dimensional       > space to use a linear classifier, or you might have something that is       > ideal for a decision tree. I recommend that you always try both.              Yes indeed.              It is also sometimes useful to mix both. That is when classes are locally       linearly separable, but globally are not. Then the decision tree could have       linear classifiers in its leaves, or least distance classifiers (not to       forget this important branch.)              > In practice, I have found that an interesting option is to use a       > decision tree on a problem and then let something like a logistic       > regression classifier cheat by getting to see some outputs of the rules       > used by the decision tree system. You can then turn the tables and let       > the decision tree system see the output of the logistic regression.       > You know you are done with this process when the decision tree system       > ignores everything except your logistic regression output.              That is really interesting. Have you published something on that?              --       Regards,       Dmitry A. Kazakov       http://www.dmitry-kazakov.de              [ comp.ai is moderated. To submit, just post and be patient, or if ]       [ that fails mail your article to |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca