Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Faster trimmed mean algorithm? #75

Open
HenrikBengtsson opened this issue Nov 4, 2015 · 1 comment
Open

Faster trimmed mean algorithm? #75

HenrikBengtsson opened this issue Nov 4, 2015 · 1 comment

Comments

@HenrikBengtsson
Copy link
Owner

Filing this for the record:

Gleb Beliakov, Fast Computation of Trimmed Means, Journal of Statistical Software, March 2011 presents an algorithm for trimmed means that is significantly faster than default ones, especially for large number of values.

Should/could matrixStats provide an implementation for this?

@karoliskoncevicius
Copy link

This issue seems to be a few years old but just wanted to vote in favour of this.

I am slowly developing a package called matrixTests and having something like rowMeans2(x, trim=0.1) would help in implementing some versions of Leven's test.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants