Prev: Reading of Simulink block output value
Next: making a linear filter mask and apply to an image
From: ImageAnalyst on 24 Apr 2010 15:46
On Apr 24, 3:41 pm, "Aadarsh " <imfromwa...(a)hotmail.com> wrote:
> "Ashish Uthama" <first.l...(a)mathworks.com> wrote in message
> >http://www.mathworks.com/matlabcentral/fileexchange/26431-qt-clusteri...
>
> Do you know how the algorithm works? Ive tried it several times but cant get it to work - have a look on the page, i left a comment.
>
> Thanks

----------------------------
The algorithm as I listed it seems fairly straightforward and easy to
understand. Are you having difficulty with that? If, instead, you're
having problems with somebody's implementation of the algorithm that
they uploaded to the File Exchange, then I suggest you contact the
author.
From: Greg Heath on 24 Apr 2010 21:26
On Apr 22, 9:01 am, "Aadarsh " <imfromwa...(a)hotmail.com> wrote:
> If i have a n unknown points and n unknown clusters, is there any algorithm which will > try to group the points into the most appropriate groups.

Did you really mean that you have the same number of clusters as you
have points?

Greg
From: Greg Heath on 24 Apr 2010 21:40
On Apr 24, 9:26 pm, Greg Heath <he...(a)alumni.brown.edu> wrote:
> On Apr 22, 9:01 am, "Aadarsh " <imfromwa...(a)hotmail.com> wrote:
>
> > If i have a n unknown points and n unknown clusters, is there any algorithm which will > try to group the points into the most appropriate groups.
>
> Did you really mean that you have the same number of clusters as you
> have points?

How many points do you have and what is their dimension?

Are there any restrictions on
1. The maximum number of clusters
2. The maximum number of members per cluster
3. The maximum member to cluster center difference
4. The maximum member to cluster root-mean-square distance.

Greg
From: Aadarsh on 25 Apr 2010 06:45
Yes its

a problem with an implementation on file exchange. I have wrote a comment on the page where the file is, and hopefully the author will reply.

Greg Heath <heath(a)alumni.brown.edu> wrote in message <ecfe8921-ade3-4b09-8041-b6e31b0aac03(a)x7g2000vbc.googlegroups.com>...
> On Apr 24, 9:26 pm, Greg Heath <he...(a)alumni.brown.edu> wrote:
> > On Apr 22, 9:01 am, "Aadarsh " <imfromwa...(a)hotmail.com> wrote:
> >
> > > If i have a n unknown points and n unknown clusters, is there any algorithm which will > try to group the points into the most appropriate groups.
> >
> > Did you really mean that you have the same number of clusters as you
> > have points?
>
> How many points do you have and what is their dimension?
>
> Are there any restrictions on
> 1. The maximum number of clusters
> 2. The maximum number of members per cluster
> 3. The maximum member to cluster center difference
> 4. The maximum member to cluster root-mean-square distance.
>
> Greg


I am trying to cluster roughly 500 pairs of points - i.e. the data is 2 dimensional.

Theoretically, there are no maximum number of clusters, although there definatley should not be the same number of clusters, as points to cluster - i know this because of how my algorithm works, prior to the clustering.

There are no maximum number of members per cluster.

There is no maximum member to cluster centre difference.

I dont know what the maximum member to cluster root-mean-square distance.

Thanks very much
From: ImageAnalyst on 25 Apr 2010 09:30
So how is that QT algorithm working for you? If you want to try
others, do a search for "unsupervised classification"

http://www.bing.com/search?q=unsupervised+classification&go=&form=QBLH&qs=AS&sk=&pq=unsupervised+cl&sp=1&sc=1-15
First  |  Prev  |  Next  |  Last
Pages: 1 2 3
Prev: Reading of Simulink block output value
Next: making a linear filter mask and apply to an image