Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!uwm.edu!csd4.csd.uwm.edu!markh
From: markh@csd4.csd.uwm.edu (Mark William Hopkins)
Newsgroups: comp.theory
Subject: Re: Least-squares clustering.
Message-ID: <11015@uwm.edu>
Date: 13 Apr 91 17:51:35 GMT
References: <11014@uwm.edu>
Sender: news@uwm.edu
Organization: University of Wisconsin - Milwaukee
Lines: 9

In article <11014@uwm.edu> markh@csd4.csd.uwm.edu (Mark William Hopkins) writes:
>   I have a particular algorithm in mind.  It takes a set, S, of N-vectors
>and partitions it into sets S1, S2 such that
>
>		    sigma(S1) + sigma(S2) is minimized
...

I forgot to finish the previous posting.  The question is: does anyone know
of such an algorithm?