Theory of Attributes
Theory of Attributes
Introduction:
Notations:
(A) ()
The classes denoted by capital letters only are called positive classes
and their frequenc ies are known as positive class frequencies. E.g. (A),
(AB), (ABC) etc. Conventionally, N i.e. universe or population is taken
as positive class.
The classes denoted by Greek letters only are called negative classes
and their frequencies are known as negat ive class frequencies. E.g.
(), ( ), ( ) etc.
Thus,
(ABC), ( C), (A C) etc. are classes of order 3 and so on.
Proof:
( ) = (A ) + ( )
If we know the 2 n ultimate class frequencies we can find all the class
frequencies.
Fundamental Set
In order to find out whether the given data are consistent or not we
have to apply a very simple test. The test is to find out whether any or
more of the ultimate class -frequencies is negative or not. If none of the
class frequencies is negative we can safel y calculate that the given
data are consistent (i.e the frequencies do not conflict in any way each
other). On the other hand, if any of the ultimate class frequencies
comes to be negative the given data are inconsistent.
Since all the ultimate class frequencies are non -negative, hence data is
consistent.
Example: Given N = 600, (A) = 250, (B) = 400 and (A ) = 200.
Or
One Attribute:
Let the attribute is A, then there will be two ultimate class frequencies
(A) and (). Hence conditions are
Tw o Attributes:
Let two attributes are A and B, then there will be four ultimate class
frequencies (AB), (A ), (B) and ( ). Hence conditions are
(AB) 0 ….(1)
(A ) 0 ….(2)
(B) 0 ….(3)
( ) 0 ….(4)
(AB) 0 ….(5)
(A ) 0 (A) – (AB) 0 or (AB) (A) ….(6)
Three Attributes:
Let three attributes are A,B and C then there will be eight ultimate
class frequencies (ABC), (AB ), (A C), ( BC), (A ), (B), ( C) and
( ). Hence conditions are
(ABC) 0 ….(9)
Then there are in all m.n classes (cells) in the contingency table. The
frequency of a typical cell corresponding A i and B j is (A i B j ).
A1 (A 1 B 1 ) (A 1 B 2 ) (A 1 B j ) (A 1 B n ) (A 1 )
A2 (A 2 B 1 ) (A 2 B 2 ) (A 2 B j ) (A 2 B n ) (A 2 )
Attribute A
Ai (A i B 1 ) (A i B 2 ) (A i B j ) (A i B n ) (A i )
Am (A m B 1 ) (A m B 2 ) (A m B j ) (A m B n ) (A m )
Total (B 1 ) (B 2 ) (B j ) (B n ) N
Independence of Attributes:
( AB ) ( A )
( B) ( )
( AB ) ( A) ( B )
.
N N N
If two attributes A and B are independent, then the value of (AB) mu st
( A).( B ) ( A).( B )
be equal to i.e. ( AB ) . This value of (AB) is called
N N
expected value of (AB) and the given value of (AB) is called observed
value.
Association of Attributes:
( A).( B )
( AB )
N
( A).( B )
If ( AB ) , then they are said to be negatively associated.
N
Solution:
(A) = 152
(B) = 512
() = 456
Now,
(A).(B)/N = =152x512/608=128=(AB)
A and B.
Solution:
If (AB), (B), (A ) and ( ) are the four distinct combination of A, B,
and then Yules’ co-efficient of association is
( AB ).( ) ( A ).(B )
Q
( AB ).( ) ( A ).(B )
Note:
Solution: Let A denote the dark eye colour of father and B denote
A
B 50 89
79 782
( AB ).( ) ( A ).(B )
Yules’ co-efficient of association is Q
( AB ).( ) ( A ).(B )
and sons’ .
Example:
of attacked.
Q =0.57
i.e., there is a negative association between attacked and vaccinated.
In other words there is a positive association between not attacked and
vaccinated. Hence vaccination can be regarded as a preventive
measure for small pox.
Solution: Let A denote boys and denote girls. Let B denote those
who passed the examination and denote those who failed.
Q = 0
Coefficient of Collignation
( A )(B )
1
( AB )( )
Y , Y lies between -1 and +1.
( A )(B )
1
( AB )( )
2Y
Q
1Y 2
(A ) ( ) ( )
m n
O ij E ij
2
2
, where O i j ’s and E i j ’s are observed and expected
i 1 j 1 E ij
frequency respectively of (i,j)th cell in a m x n Contingency Table.
Vs
2 2
Pearson’s Coefficient of Contingency (C) C
2 N 1 2
2
Tschuprow ’s Coefficient (T ) T
2 2
, W here r and c are no.
( r 1)(c 1)
of rows and columns respectively in contingency table.