From: mailbox@dmitry-kazakov.de   
      
   On Wed, 06 Apr 2005 07:09:00 GMT, Neil wrote:   
      
   > I have a simple questions that I would be grateful if someone could kindly   
   > answer. Can decision trees bu used to classify linearly inseparable   
   > problems.   
      
   Yes.   
      
   A trivial example: there is one feature x. The class C1 is the interval   
   [0,1]. The class C2 is the rest.   
      
   C1 = { x | x in [0,1] }   
   C2 = not C1   
      
   Clearly C1 and C2 are not linearly separable in R. A decision tree that   
   classifies x is:   
      
   if x in [0,1] then   
      return C1;   
   else   
      return C2;   
   end if;   
      
   --   
   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 , and ]   
   [ ask your news administrator to fix the problems with your system. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)