similar to: R function for Bisecting K-means algorithm

Hi guys, I've been using the kmeans and hclust functions for some time now and was wondering if I could specify a custom metric when passing my data frame into hclust as a distance matrix. Actually, kmeans doesn't even take a distance matrix; it takes the data frame directly. I was wondering if there's a way or if there's a package that lets you create distance matrices from

I was wondering if there was an R equivalent to the two phased approach that MATLAB uses in performing the Kmeans algorithm. If not is there away that I can determine if the kmeans in R and the kmeans in MATLAB are essentially giving me the same clustering information within a small amount of error? -- View this message in context:

Hello All, I'm having some trouble figuring out what the clearest way to plot my k-means clustering result on an my existing MDS. First I performed MDS on my distance matrix (note: I performed k-means on the MDS coordinates because applying a euclidean distance measure to my raw data would have been inappropriate) canto.MDS<-cmdscale(canto) I then figured out what would be my optimum

Dear members. I am having problems to understand the kmeans- results in R. I am applying kmeans-algorithms to my big data file, and it is producing the results of the clusters. Q1) Does anybody knows how to find out in which cluster (I have fixed numberofclusters = 5 ) which data have been used? COMMAND (kmeans.results <- kmeans(mydata,centers =5, iter.max= 1000, nstart =10000)) Q2) When I

Hi all, I am trying to run the k-means cluster analysis using the function kmeans in the package cluster. The data are: x = c(-0.26, -0.23, -0.05, -0.20, 0.30, -0.84, -0.10, -0.12, 0.10, -0.31, -0.19, 0.18, -0.26, -0.23, -0.37, -0.23) I've got two different solutions when I ran this function over a few times: kmeans(x, centers=2) The first solution gives the following: $cluster [1]

Hi the devel list, I am using K means with a non standard distance. As far as I see, the function kmeans is able to deal with 4 differents algorithm, but not with a user define distance. In addition, kmeans is not able to deal with missing value whereas there is several solution that k-means can use to deal with them ; one is using a distance that takes the missing value in account, like a

Hello, I am hoping you can help me with a question concerning kmeans clustering in R. I am working with the following data-set (abbreviated): BMW Ford Infiniti Jeep Lexus Chrysler Mercedes Saab Porsche Volvo [1,] 6 8 2 8 4 5 4 4 7 7 [2,] 8 7 4 6 4 1 6 7 8 5 [3,] 8 2 4

? stato filtrato un testo allegato il cui set di caratteri non era indicato... Nome: non disponibile Url: https://stat.ethz.ch/pipermail/r-help/attachments/20070319/0bf66722/attachment.pl

Hello, I'm new using R. I'm trying to develop a K-means Clustering with R for some data I have, however each time I use that instruction with the same data my cluster means, clustering vector and within cluster sum of square change and I don't understand why because I use the same parameters and the same data. Can anybody explain me why does it happen? Thank you Act. Calef

*Apologies if this is not the right way to ask a question, I'm a first timer posting here. Does anyone have a solution to this? I'm having trouble figuring out how to use weighting with K Means Clustering. So say if my dataset is: Column 1 = x coords Column 2 = y coords Column 3 = frequency each coordinate occurs So I'm basically trying to weight the points more heavily if

Hi all, I am wandering.. is it possible to cluster data which is in a single column ? for example.. I have some data as follows: 4013 7362 7585 9304 11879 14785 21795 30500 30669 30924 33988 36975 40422 42911 50501 51593 53729 54338 55497 57337 61993 62601 66229 69815 69933 70760 71340 75921 83972 90134 91061 . . . is it possible to cluster this data since it is in a single column ? I have

K-means recluster data with given cluster centers Dear R user, I have several large data sets. Over time additional new data sets will be created. I want to cluster all the data in a similar/ identical way with the k-means algorithm. With the first data set I will find my cluster centers and save the cluster centers to a file [1]. This first data set is huge, it is guarantied that cluster

Hello, I've been working on the KMeans clustering algorithm recently and since the past week, I have been stuck on a problem which I'm not able to find a solution to. Since we are representing documents as Tf-idf vectors, they are really sparse vectors (a usual corpus can have around 5000 terms). So it gets really difficult to represent these sparse vectors in a way that would be

Dear R users I have the matrix of the centres of some clusters, e.g. 20 clusters each with 100 dimentions, so this matrix contains 20 rows * 100 columns numeric values. I have collected new data (each with 100 numeric values) and would like to keep the above 20 centres fixed/'unmoved' whilst just see how my new data fit in this grouping system, e.g. if the data is close to cluster 1

Hi, I need some answers regarding to R. In K-means clustering ,for K=2, How can I find the members of each cluster and What are the coordinates for the cluster centers? Please send me a reply soon. Thank You Sent from Windows Mail [[alternative HTML version deleted]]

Hi, I like to present the results from the clustering method k-means in terms of variances: within and between Cluster. The k-means object gives only the within cluster sum of squares by cluster, so the between variance part is missing,for calculation the following table, which I try to get. Number of | Variance within | Var between | Var total | F-value Cluster k | cluster | cluster

Buen día, no sé si estoy utilizando bien la lista, es la primera vez. Si lo hago mal me corrigen por favor. Sobre tu comentario Pedro, muchas gracias. Lo qeu entiendo con tu sugerencia de set.seed es qeu de esa forma fijas los resultados, pero no estoy seguro si otra agrupación funcione mejor. Es decir me interesa un método de agrupación que genere la "mejor" agrupación y como los

Hi all I am working on k-means algorithm (in R: kmeans( ) ). The R-help advice us to try several random start in order to avoid local minimum. Does one know if there is a procedure that automaticly run this rerolling and select the best partition ? Or any studies that gives clues on the number of rerolling ? Thanks for helping. Christophe

Dear R user, How can I get the C or C++ source code of the "R_kmeans_MacQueen" or "R_kmeans_Lloyd" subroutines implemented in the R "kmeans" function of the R stats-package {stats}? Would these be available as a C header file (*.h) somewhere from the R installation??? Any help to get a C or C++ implementation of these clustering algorithms would be very

Hi, I have used the kmean fucntion in R to produce some results for my analysis. I like to know the specific underlying algorithm used for the implementation of the function kmean in R. I tried looking for some documents but could not find any. I obtained the kmean result for k ranging from 2 to 10. When i did this initally it worked perfectly. When i tried running again i get the error