similar to: [OT] old news on the home page

Hello, I would like to know if there is a function in an R library that allows to do cluster analysis under contiguity constraints ? Thank you very much for your answer ! Lise Bellanger -- Lise Bellanger, Universit? de Nantes D?partement de Math?matiques, Laboratoire Jean Leray UMR CNRS 6629 2, Rue de la Houssini?re BP 92208 - F-44322 Nantes Cedex 03 T?l. : (33|0) 2 51 12

Not sure who to send this to... On the books page http://www.r-project.org/doc/bib/R-books.html the entries from [54] down have three forward slashes in the hyperlinks to publisher info and so they don't work Robin [[alternative HTML version deleted]]

Hi - Writing to see if someone can suggest whether a problem warrants a bug report. It concerns the use of stepFlexclust in the flexclust package. The problem concerns the size of clusters returned. Versions: R-2.7.0 on Windows XP; RODBC_1.2-3 code snippet: r8 <- stepFlexclust(df,8,nrep=100,FUN=kcca, family=kccaFamily("kmedians")) summary(r8) ## returns cluster sizes of 51, 115,

Dear all, I have just found a 'good' tutorial R for datamining. I think it should be on the contributed docs. http://cran.r-project.org/other-docs.html Here is the link http://www.liaad.up.pt/~ltorgo/DataMiningWithR/ What do you think? Kind regards Christophe -- Christophe Dutang Ph. D. student at ISFA, Lyon, France website: http://dutangc.free.fr

Hi All, For the function "bclust"(e1071), the argument "base.method" is explained as "must be the name of a partitioning cluster function returning a list with the same components as the return value of 'kmeans'. In my understanding, there are three partitioning cluster functions in R, which are "clara, pam, fanny". Then I check each of them to

Dear R users, When I run the following code, R crashes: require(cclust) x <- matrix(c(0,0,0,1.5,1,-1), ncol=2, byrow=TRUE) cclust(x, centers=x[2:3,], dist="manhattan", method="kmeans") While this works: cclust(x, centers=x[2:3,], dist="euclidean", method="kmeans") I'm posting this here because I am not sure if it is a bug. I've been searching

On Thu, Jul 23, 2009 at 3:04 PM, Duncan Murdoch<murdoch at stats.uwo.ca> wrote: > On 23/07/2009 8:58 AM, Rainer M Krug wrote: >> >> Hi >> >> I hope this is the right mailing list - if not, could you please refer >> me to a mora appropriate? >> >> My question: >> >> I am using sweave (in LyX with beamer) for a lecture and I would like

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

Hi, I have a package that I'd like to submit to CRAN that does Sweave-like processing on Open Document format files from Open Office. If I remember correctly, there is a machine that automatically R CMD checks CRAN packages. I have two questions about how that system is set up: 1. Is the bitmap device available? The example produces a file using this device and I'd like it to pass R

Dear List, I'd like to set up a package repository so I can use install.packages() on it for home-grown packages. I set up an AMPP infrastructure on a windows box already, but I'm pretty lost with respect to what to do next as I didn't do any web-programming/admin yet. Could anyone recommend some r-specific tutorials or has a couple of suggestions for me? I've had a look at the

Hi, in approximately one months time mentoring institutions can propose projects for the Google Summer of Code 2009, see http://code.google.com/soc/ Last year the R Foundation succesfully participated with 4 projects, see http://www.r-project.org/SoC08/ for details. We want to participate again this year. Our project proposals will be managed by Manuel Eugster (email address in CC). Manuel

Dear UseRs!, Everything about UseR! 2010 was terrific! I really mean "everything" - the tutorials, invited talks, kaleidoscope sessions, focus sessions, breakfast, snacks, lunch, conference dinner, shuttle services, and the participants. The organization was fabulous. NIST were gracious hosts, and provided top notch facilities. The rousing speech by Antonio Possolo, who is the chief

Hello all, I've been able to use R very successfully to run simple statistics and generate the plots I require. I've been evaluating Sweave, and have hit upon a small problem that I don't seem to be able to workaround. Sweave runs very well for single file latex documents, but I have a complex thesis made up of several parts and chapters. These are arranged with a master latex file

Hi there, I'm doing some clustering analysis and try to find all the algorithms related to clustering in R. Here is the list of the algorithms I found. But I'm not sure if It's the complete list. Could you please check it and see if there're other ones? Thank you very much! P.S.: List of the algorithms related to clustering: (1) Hierarchical methods hclust

Hi, I'm not sure if Sweave questions should go to the general list, but it seems to be part of the core R package without a separate maintainer. I am writing a tutorial for R in a latex file. I'd like to use Sweave, since this seems its ideal usage. The problem is that I want to purposefully put errors in and then the output that comes with it in the text of my tutorial. However the

Dear R experts, we are preparing an R-package to compute the Oja Median which contains some C++ code in which random numbers are needed. To generate the random numbers we use the following Mersenne-Twister implementation: // MersenneTwister.h // Mersenne Twister random number generator -- a C++ class MTRand // Based on code by Makoto Matsumoto, Takuji Nishimura, and Shawn Cokus // Richard J.

Dear useRs and developeRs, I hope all attending useR! in Dortmund last week had as much a good time as I had and a safe trip home. This email is to announce our plans for forthcoming conferences. In 2009 there will be a useR! in Rennes, France (July 8-10), directly followed by a DSC in Copenhagen, Denmark (July 13-14). We would like to have a useR! 2010 in North America, and 2011 in Europe.

Dear useRs and developeRs, I hope all attending useR! in Dortmund last week had as much a good time as I had and a safe trip home. This email is to announce our plans for forthcoming conferences. In 2009 there will be a useR! in Rennes, France (July 8-10), directly followed by a DSC in Copenhagen, Denmark (July 13-14). We would like to have a useR! 2010 in North America, and 2011 in Europe.

> Date: Mon, 2 Feb 2009 12:56:15 +0100 > From: friedrich.leisch at stat.uni-muenchen.de > Subject: Re: [R] Problems in Recommending R > To: thomas.petzoldt at tu-dresden.de > Cc: "r-help at r-project.org" <r-help at r-project.org>, > useR-2009 at r-project.org, paul at stat.auckland.ac.nz > Message-ID: <18822.57183.637787.426445 at

Dear R developers, The trace of the hat matrix H~(n,n) is computed as follows: tr(H) = tr(BS^-1B') = tr(S^-1B'B) := tr(X) = sum(diag(X)) with B~(n,p), S~(p,p). Since p is of the order 10^3 but S is sparse I would like to employ Taucs linear solver ( http://www.tau.ac.il/~stoledo/taucs/ ) on SX = B'B. (Further improvement by implying a looping over i=1,...,p, calling