similar to: Permutation test and R2 problem

I want learn permutation test and resampleing, etc. There are a few references listed below. I'm wondering what is the best book on this topic. Can somebody give me some advice. Thank you! http://en.wikipedia.org/wiki/Resampling_%28statistics%29#Permutation_test

I am perfectly aware that this question is not an R question, at least not yet, but I have not succeeded in finding what I want in other ways, so ... What I am looking for are two algorithms, preferabley in Pascal, but other languages may do. For (a) systematic (complete) permutations for grouped data with unequal group sizes, and (b) random permutations for the same kind of data. I know

Hi there, I would like to find a more efficient way of permuting the rows and columns of a symmetrical matrix that represents ecological or actual distances between objects in space. The permutation is of the type used in a Mantel test. Specifically, the permutation has to accomplish something like this: Original matrix addresses: a11 a12 a13 a21 a22 a23 a31 a32 a33 Example

Hi all Consider the classic data below from Darwin on the heights of 15 pairs of zea mays (corn) plants either cross-fertilized or self-fertilized, where the goal is to see if it makes a difference. > head(ZeaMays) pair pot cross self diff 1 1 1 23.500 17.375 6.125 2 2 1 12.000 20.375 -8.375 3 3 1 21.000 20.000 1.000 4 4 2 22.000 20.000 2.000 5 5 2 19.125

Hi, I'm very new to working with sparse matrices and would like to know how I can column permute a sparse matrix. Here is a small example: > M1 <- > spMatrix(nrow=5,ncol=6,i=sample(5,15,replace=TRUE),j=sample(6,15,replace=TRUE),x=round_any(rnorm(15,2),0.001)) > M1 5 x 6 sparse Matrix of class "dgTMatrix" [1,] 2.983 . 1.656 5.003 . . [2,] .

Dear R users, I am trying to perform a hypothesis test on a marked point pattern. I would like to calculate the mean of the absolute value of the difference of marks between nearest neigbours, randomize the marks among points, then calculate this mean again. Ideally, I would test whether random mean values smaller than the observed mean value occur less than 5% of the time. I suppose 1000

> Dear R experts, >I am sorry for my inability. >I have the following dataset: > Qtot Itot >1 73 684 >2 64 451 >3 71 378 >4 65 284 >5 47 179 >6 31 117 >7 19 69 > >Now I need to perform Monte Carlo Pertutation test underlaying the following condition. > > >Condition > >In order to choose randomly (5000 times) for the Qtot

Hi all, I try to generate sets of strategies that contain probability distributions for a defined number of elements, e.g. imagine an animal that can produce 5 different types of offspring and I want to figure out which percentage of each type it should produce in order to maximize its fitness. In order to do so, I need to calculate the fitness for all potential strategies. As an example, if I

I am looking for an algorithm (written in R (preferably) or C, but even pseudo-code in a text book maybe fine) to determine the sign of a permutation. What is that? Well, a permutation is either even or odd, the sign is +1 or -1, respectively, see, e.g., http://en.wikipedia.org/wiki/Signature_of_a_permutation which also says >> In practice, in order to determine whether a given

J?r?me, As a first attempt, how about the function below. It works (or not) by randomly sorting the rows and columns, then searching the table for "squares" with the corners = matrix(c(1,0,0,1),ncol=2) and subtracting them from 1 to give matrix(c(0,1,1,0),ncol=2) (and vice versa). Randomized matrices can be produced as a chain where each permutation is seeded with the previous one.

The memory permutation cause a slow down in case of a save/restore (bug 1143). It works better when the mixing is done with 2MB chunks. Signed-off-by: Jean Guyader <jean.guyader@eu.citrix.com> _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

Hi all can any one of you write a script for the following problem Let X be a matrix of random normal values (mean =0; sd=1) (see rnorm() function) having 10 columns and N=100 rows. Let the first row in the matrix be (1,1.5,1.4,3,1.9,4,4.9,2.6,3.2,2.4). Assume that the first 5 columns of data for each row correspond to a group A, while the remaining 5 to another group B. For each row of the

Dear R users, I want to perform an exact permutation of multisets. I have looked at the coin package, but it doesn't seem to offer what I am looking for. I want to perform permutations (exact - without duplications) on multisets of scalars (e.g., the multiset 0,0,1,2,2). I want to output all the possible permutations into a data frame so that each multiset permutation occupies a row (or

The other day I was looking into one of the classics in resampling, Eugene Edgington's "Randomization Tests". This type of test is simple to do in R with things like a simple correlation, the sample () function is perfect for the purpose. However, things are more complex if you have grouped data, like a one-way ANOVA. The reason is that you have to avoid the consideration of

I saw the manual of this function but not sure what to do. I have a array contain 7 numbers and want to choose 4 to do permutation test. But using this function with parameters as onet.permutation(scores,4), it returns 0. Instead, with no parameter, onet.permutation(), it returns something but every time it's different. Please tell me how am I supposed to do it. Thanks a lot -- View this

> On May 22, 2018, at 10:57 PM, John <miaojpm at gmail.com> wrote: > > Thanks, David. > I got the answer from the web. > Is there any easy way to permute a set (e.g., a set of characters) by the permutation it returns? Thanks, > > > > x <- c(10,7,4,3,8,2) > > sort(x, index.return=TRUE) > $x > [1] 2 3 4 7 8 10 > > $ix > [1] 6 4 3 2

Thanks, David. I got the answer from the web. Is there any easy way to permute a set (e.g., a set of characters) by the permutation it returns? Thanks, > x <- c(10,7,4,3,8,2) > sort(x, index.return=TRUE) $x [1] 2 3 4 7 8 10 $ix [1] 6 4 3 2 5 1 2018-05-23 10:49 GMT+08:00 David Winsemius <dwinsemius at comcast.net>: > > > > On May 22, 2018, at 10:06 PM, John

Hello, Like David said, what you are trying to do with sort() can be done with order() in a much easier way. First, your code x <- sort(c("bc","ac","dd"), index.return=TRUE) Now, with function order() i <- order(c("bc", "ac", "dd")) y <- c("D","E", "F")[i] y #[1] "E" "D"

R users, Is it possible to do 'exact' permutation tests in R? If I run a perm.test or permutation.test.discrete on a data set that has, for example, 720 possible permutations, will that test permute ALL of those possible permutations, or will it just permute 720 random permutations (thus allowing some possibilities to repeat and some not to be permuted at all)? I'm a little confused

> sort(c("bc","ac","dd"), index.return=TRUE) $x [1] "ac" "bc" "dd" $ix [1] 2 1 3 We have the permutation, namely 1-->2, 2-->1, 3-->3. How can I apply the permutation function to a new set c("D","E", "F")? so that the result is c("E","D", "F"). 2018-05-23 11:06