The solitude preserving data excavating plays a vital duty in statistical agencies and table privacy inquiries, which are concerned with continuing secrecy disclosure all the while data excavating. The large-sized dataset holds sensitive association rules, that are required expected hidden from unauthorized consumers. Thus, association rule concealing is a competent solution that helps resourcefulnesses keeps away from the hazards caused by delicate knowledge discharge when sharing the data in their cooperations. This paper presents a constraint based growth model for concealing delicate association rules through the formulation of a clear Integer Linear Programming (ILP). The developed form reduces the database sanitization problem to a Constraint Satisfaction Problem, that is solved using ILP. Sanitization treasure performs concealing of sensitive rules by reducing the support or the assurance of the sensitive rules. The results of the experimental judgment of the proposed approach on corporal datasets indicate the promising conduct of the approach in terms of reactions on the original database.
Author(s) Details:
B. Suma,
Department
of Computer Science and Engineering, R V College of Engineering, Bengaluru,
India.
G.
Shobha,
Department
of Computer Science and Engineering, R V College of Engineering, Bengaluru,
India.
Please see the link here: https://stm.bookpi.org/TAIERT-V5/article/view/9058
No comments:
Post a Comment