Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news4.ner.bbnplanet.net!cam-news-hub1.bbnplanet.com!uunet!in3.uu.net!news.nevada.edu!news.sprintlink.net!news-ana-7.sprintlink.net!news.sprintlink.net!news-ana-24.sprintlink.net!interpath!news.interpath.net!sas!newshost.unx.sas.com!saswss
From: saswss@hotellng.unx.sas.com (Warren Sarle)
Subject: Re: what is K-means algorithm
Originator: saswss@hotellng.unx.sas.com
Sender: news@unx.sas.com (Noter of Newsworthy Events)
Message-ID: <Dw77n5.EzG@unx.sas.com>
Date: Thu, 15 Aug 1996 21:28:17 GMT
X-Nntp-Posting-Host: hotellng.unx.sas.com
References: <4trca8$db3@qualcuno.nettuno.it> <51k9vexq41.fsf@kal-el.ugr.es> <4upspd$81f@nuscc.nus.sg> <4us34b$cos@eng_ser1.erg.cuhk.hk>
Organization: SAS Institute Inc.
Lines: 18


In article <4us34b$cos@eng_ser1.erg.cuhk.hk>, wklam@cs.cuhk.hk (Connection Refused) writes:
|>      Actually, there are quite a number of clustering algorithms that
|> can automatically detect the number of clusters inside a data set, but
|> with the constraint that the number you assume must greater the real
|> one.

An algorithm than can reliably determine the number of clusters
for nontrivial data and that is not as computationally intensive
as bootstrapping or MCMC would be quite a revelation. Could we have
some references, please?


-- 

Warren S. Sarle       SAS Institute Inc.   The opinions expressed here
saswss@unx.sas.com    SAS Campus Drive     are mine and not necessarily
(919) 677-8000        Cary, NC 27513, USA  those of SAS Institute.
