From: immathlover@yahoo.com   
      
   Hi everyone,   
      
   All the usual clustering methods I am aware of (such as k-means, Fuzzy   
   k-means, etc.) find all the clusters together. I mean, as you know,   
   they consider some cost function minimizing which (by an iterative   
   method for instance) finds all the clusters.   
      
   I am wondering if there is any clustering method which can find the   
   clusters one by one. That is it can first find just one of the   
   clusters, and then if the process is continued (I mean I need a method   
   which can be quitted after finding any number of clusters; that is, it   
   doesn't need to be run till finding all the clusters so as to have a   
   correct answer) it would find a second one, and so on. Of course, I   
   would trivially prefer the method to have a quality closely comparable   
   with the usual methods (such as k-means).   
      
   I would really appreciate it if you could please introduce me some of   
   these methods.   
      
   Thanks a lot.   
      
   [ comp.ai is moderated ... your article may take a while to appear. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)