# Re: [Rd] Fastest non-overlapping binning mean function out there?

From: Terry Therneau <therneau_at_mayo.edu>
Date: Wed, 03 Oct 2012 07:50:45 -0500

Look at rowsum. It's pretty fast C code.

Terry T

On 10/03/2012 05:00 AM, r-devel-request_at_r-project.org wrote:
> Hi,
>
> I'm looking for a super-duper fast mean/sum binning implementation
> available in R, and before implementing z = binnedMeans(x y) in native
> code myself, does any one know of an existing function/package for
> this? I'm sure it already exists. So, given data (x,y) and B bins
> bx[1]< bx[2]< ...< bx[B]< bx[B+1], I'd like to calculate the
> binned means (or sums) 'z' such that z[1] = mean(x[bx[1]<= x& x<
> bx[2]]), z[2] = mean(x[bx[2]<= x& x< bx[3]]), .... z[B]. Let's
> assume there are no missing values and 'x' and 'bx' is already
> ordered. The length of 'x' is in the order of 10,000-millions. The
> number of elements in each bin vary.
>
> Thanks,
>
> Henrik

R-devel_at_r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-devel Received on Wed 03 Oct 2012 - 12:55:12 GMT

This quarter's messages: by month, or sorted: [ by date ] [ by thread ] [ by subject ] [ by author ]

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.2.0, at Wed 03 Oct 2012 - 13:00:44 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-devel. Please read the posting guide before posting to the list.