k-means or not?

I have the following data by browsing a bunch of java code
repositories:

(method1 , method2 , # of times method 1 and 2 occur together)

I want to use clustering to suggest a group of methods that commonly
occur together. Can I use k-means for this (assuming i know the number
of clusters I want)? How exactly would I set things up in that case?
Or should I be using some other clustering technique?

appreciate the help!
Thanks!
-A

.

Relevant Pages

  • Clustering on RHAS?
    ... Initially it is not expected to have heavy usage, ... Is anybody currently using clustering on RHAS? ... Thanks a bunch! ...
    (RedHat)
  • Re: Clustering on RHAS?
    ... > Then I remembered that RH has something called RH Clustering, ... > found a whole bunch about it on their web page ... Red Hat Community Ambassador Program ... unsubscribe mailto:redhat-list-request@redhat.com?subject=unsubscribe ...
    (RedHat)
  • Re: Clustering on RHAS?
    ... Ed Wilts wrote: ... >>Then I remembered that RH has something called RH Clustering, ... >>found a whole bunch about it on their web page ... -- redhat-list mailing list unsubscribe mailto:redhat-list-request@redhat.com?subject=unsubscribe ...
    (RedHat)
  • HP Clusters
    ... way of clustering a bunch of old j-6000 workstations. ... into creating a computational cluster for some engineering apps that ...
    (comp.sys.hp.hpux)
Loading