2064 search results for "twitteR"

Random graphs with fixed numbers of neighbours

November 24, 2010
By
Random graphs with fixed numbers of neighbours

In connection with Le Monde puzzle #46, I eventually managed to write an R program that generates graphs with a given number n of nodes and a given number k of edges leaving each of those nodes. (My early attempt was simply too myopic to achieve any level of success when n was larger than

Read more »

The joys of teaching R

November 23, 2010
By
The joys of teaching R

Just read a funny but much to the point blog entry on the difficulties of teaching proper programming skills to first year students! I will certainly make use of the style file as grading 180 exams is indeed a recurrent nightmare… Filed under: R,...

Read more »

Great-circle distance calculations in R

November 23, 2010
By
Great-circle distance calculations in R

Recently I found myself needing to calculate the distance between a large number of longitude and latitude locations. As it turns out, because the earth is a three-dimensional object, you cannot simply pretend that you are in Flatland, albeit some … Continue reading →

Read more »

R and AOL in NYC

November 23, 2010
By

R and the NYC R User Group get brief mentions in this article about AOL's offices in New York City. The NYC UseRs meet at AOL and (ironically) the next meeting on Dec 9 is on the topic of R at Google. New York Observer: Bringing Some Sizzle to the Dial-Up King (via)

Read more »

R Style Guide

November 23, 2010
By
R Style Guide

Each year I have the pleasure (actually it’s quite fun) of teaching R programming to first year mathematics and statistics students. The vast majority of these students have no experience of programming, yet think they are good with computers because they use facebook! The class has around 100 students, and there are eight practicals. In

Read more »

Robust adaptive Metropolis algorithm [arXiv:10114381]

November 23, 2010
By
Robust adaptive Metropolis algorithm [arXiv:10114381]

Matti Vihola has posted a new paper on arXiv about adaptive (random walk) Metropolis-Hastings algorithms. The update in the (lower diagonal) scale matrix is where is the current acceptance probability and the target acceptance rate; is the current random noise for the proposal, ; is a step size sequence decaying to zero. The spirit of

Read more »

R.I.P. StatProb?

November 22, 2010
By
R.I.P. StatProb?

As posted in early August from JSM 2010 in Vancouver, StatProb was launched as a way to promote an on-line encyclopedia/wiki with the scientific backup of expert reviewers. This was completely novel and I was quite excited to take part in the venture as a representative of the Royal Statistical Society. Most unfortunately, the separation

Read more »

Access the InfoChimps API from R

November 22, 2010
By

InfoChimps.com is mainly known as a clearinghouse for finding large data sets, for free or for sale. But they have also released (in beta, at least) an API that lets you find some pretty useful information on-demand. Normally, you'd have you use RESTful calls to access the API, but now Drew Conway has created an R package (and released...

Read more »

Graphical comparison of MCMC performance [arXiv:1011.445]

November 22, 2010
By
Graphical comparison of MCMC performance [arXiv:1011.445]

A new posting on arXiv by Madeleine Thompson on a graphical tool for assessing performance. She has developed a software called SamplerCompare, implemented in R and C. The graphical evaluation plots “log density evaluations per iteration times autocorrelation time against a tuning parameter in a grid of plots where rows represent distributions and columns represent

Read more »

My First R Package: infochimps

November 20, 2010
By

I have finally taken the plunge and created my first R package! As frequent readers will know, I often sing the praises of infochimps, a startup out of Austin, TX attempting to be the world’s data clearinghouse. While infochimps is an excellent resource for data sets, they also provide their own set excellent data

Read more »