In l diversity, the requirement is to have l diverse classes in an equivalence class. But this may be susceptible to an attack if the attacker knows l.

N - diversity: THIS REDUCES THE CHANCE OF SKEW ATTACK

say you have 6 anonymous, 3 diverse.

l diversity: would probably give u a combination like 4 1 1.

n diversity: will not let the number of occurrences of one value of SA exceed 2.

formula: should not exceed capping constant, n= int (floor(k/l))

take above example, k=6 and l=3 int(floor(6/3))=2. N diversity will cap the maximum representation of any class at 2. So possible combinations are: 2 2 2, 2 1 1 2, 1 1 1 1 2, 1 1 1 1 1 1.

Hypothesis:

n diversity returns firsts sequence produced such that they add up to k and the elements of the sequence are less than or equal to the capping constant n.

Key Points Of Interest:

1. The record removed is the one with the maximum score. This ensures a lower COD. This is because the displacement is minimum.
2. Try to ensure equal representation of sensitive attributes in an equivalence class. with the advent of the capping constant, we ensure that no sensitive attribute is present more than n number of times.

RESULTS AND OBSERVATIONS: