An l-MDAV microaggregation algorithm for sensitive attribute l-diversity

MDAV algorithm is a high efficient multivariate microaggregation algorithm. However, it does not consider the sensitive attribute diversity constraint, so the anonymity table yielded by the algorithm cannot resist homogeneity attack and background knowledge attack. To solve the problem, the paper proposes a microaggregation algorithm for sensitive attribute diversity - l-MDAV algorithm. The algorithm groups the nearest tuples to cluster center into one cluster, which has at least l distinct sensitive values, so the anonymity table yielded by the algorithm satisfies sensitive attribute l-diversity constraint and can resist homogeneity attack and background knowledge attack. Experimental results show that the algorithm can yield anonymity table satisfying l-diversity constraint efficiently.