Using Data Compressors to Construct Rank Tests

Details Using Data Compressors to Construct Rank Tests Using Data Compressors to Construct Rank Tests

2007-09-05

arxiv.org/abs/0709.0670v1

Applied Mathematics Letters, 22:7, 1029-1032, 2009

Computer Science

Data Structures and Algorithms

Scientific paper

Nonparametric rank tests for homogeneity and component independence are proposed, which are based on data compressors. For homogeneity testing the idea is to compress the binary string obtained by ordering the two joint samples and writing 0 if the element is from the first sample and 1 if it is from the second sample and breaking ties by randomization (extension to the case of multiple samples is straightforward). $H_0$ should be rejected if the string is compressed (to a certain degree) and accepted otherwise. We show that such a test obtained from an ideal data compressor is valid against all alternatives. Component independence is reduced to homogeneity testing by constructing two samples, one of which is the first half of the original and the other is the second half with one of the components randomly permuted.

Affiliated with

Also associated with

No associations

Rating

Using Data Compressors to Construct Rank Tests does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Using Data Compressors to Construct Rank Tests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Data Compressors to Construct Rank Tests will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-470784