CLASS-L Archives

October 2002

CLASS-L@LISTS.SUNYSB.EDU

Options: Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender:
"Classification, clustering, and phylogeny estimation" <[log in to unmask]>
Subject:
From:
"Marinucci, Max (MB Ergo)" <[log in to unmask]>
Date:
Wed, 23 Oct 2002 09:22:57 +0100
Content-Type:
text/plain; charset="iso-8859-1"
MIME-Version:
1.0
Reply-To:
"Classification, clustering, and phylogeny estimation" <[log in to unmask]>
Parts/Attachments:
text/plain (47 lines)
Dear all


I would like to know if there is some clustering provedure which does the
following.Given a data set with n observations on k variables with
correlations matrix R (k x k) I would like to obtain 3 cluster of
approximatively equal size n1=n2=n3 that satisfy the following condition.


The correlations matrix of each of the three subgroups should be as close as
possible each other and with respect to the pooled correlation matrix, That
is R1=R2=R3=R


Do you have any suggestions or ideas on how to proceed to obtain such
partitions?


Thanx a lot


Massimiliano Marinucci


Phd candidate


Universidad Complutense Madrid






====================================================
This email is confidential and intended solely for the use of the
individual or organisation to whom it is addressed. Any opinions or
advice presented are solely those of the author and do not necessarily
represent those of the Millward Brown Group of Companies.  If you are
not the intended recipient of this email, you should not copy, modify,
distribute or take any action in reliance on it. If you have received
this email in error please notify the sender and delete this email
from your system. Although this email has been checked for viruses
 and other defects, no responsibility can be accepted for any loss or
damage arising from its receipt or use.
====================================================

ATOM RSS1 RSS2