1 Np Methods
1 Np Methods
Methods
By
Prof. S.U. Gulumbe
Introduction
1. First techniques of inference made a good many assumptions about the nature of population from
which data were drawn
• For examples;
• the assumptions could be that the set of scores were drawn from a normally distributed
population or
• the assumption may be that the set of scores were drawn from population having same
variance
2. Now days, a large number of techniques have been developed which do not make stringent
assumptions about parameters.
3. Parametric procedure, where ever suitable is more powerful than an approximate nonparametric
procedure.
4. Different techniques are called for, depending on the nature of data, which may be of any of the
following types: Norminal, Ordinal , Interval or Ratio
5. Examples : Norminal ( e.g sex, Colour), Ordinal (e.g status of health—good, poor, or mediocre),
Interval (e.g temperature ) and Ratio (e.g height, weight, etc)
Some advantages of NP methods
NP methods has certain desirable properties that hold under mild assumptions
regarding underlying populations from the data is obtained
2. NP procedures enable user to obtain exact p-value for test, exact coverage
probability for CI, etc
3. NP techniques are usually (not always) easy to apply than the normal based theory
counter parts
5. NP techniques are mildly more efficient than the normal based competitors when the
underlying populations are not normal
7. They are applicable in many situations where normal theory procedures cannot be
utilised
• The first step in the runs test is to count the number of runs in the data sequence. There are several ways to
define runs in the literature, however, in all cases the formulation must produce a dichotomous sequence of
values. For example, a series of 20 coin tosses might produce the following sequence of heads (H) and tails (T).
HHTTHTHHHHTHHTTTTTHH
The number of runs for this series is nine. There are 11 heads and 9 tails in the sequence.
•
Runs test Method
Let n1 = the number of events of one type and n2= the number of events of another type. Now n1 + n2 is the total
numbers of events.
If both n1 and n2 are equal to or less than 20 (or some cases, less 10) tables given critical values of r under Ho for
α = 0.05
If the observed value of r falls between the critical values, we accept the Ho.
If the observed value of r is equal to or more extreme than one of the critical values, we reject Ho
• For small-sample runs test, there are tables to determine critical values that depend on values of n1 and n2.
• F1 gives values of r which are so small that the probability associated with their occurrence under H0 is p = 0.025
• FII gives values of r which are so large that the probability associated with their occurrence under H0 is p = 0.025
• Any observed value of r which is equal to or less than the value shown in Fi OR is equal to or larger than the value
shown in FII is in the region of rejection for α = 0.05
Runs test on large samples
• The test statistics is given
R − R̄
Z=
SR
where R is the observed number of runs, R̄ is the expected number of runs and SR is the standard deviation
of the number of runs. The values of R̄ and SR are computed by
2n1n2
R̄ = +1
n1 + n2
where n1 and n2 are the number of type I and type II events in the sequence respectively. Thus n1 + n2 gives
the total number of observations.
| Z | > Z1−α/2
For large-sample runs test (N1 > 10 and n2 > 10 ), the test statistics is compared to a standard normal table.
That is , at 5% significant level, a test statistics with absolute value greater than 1.96 indicates non-
randomness.
Examples
• Example 1. Is the sequence of turn choices in a maze random? The sequence
are: LLLRLRRRRLLLLLLLRRRRLR
In this case there are n1 =12 and n2 =10 left and right turns in the sequence. The
number of runs is 8.
Thus, we have
2(12)(10)
R̄ = + 1 = 11.91
12 + 10
R − R̄ 8 − 11.9
Z= = = − 1.7232
σR 2.269
• Example 2: