FP-Growth Policy Mining for Access Control Policies
Ajinkya Kalaskar, Vishali Barkade · 2018
In this paper we propose a technique known as FP-growth algorithm to mining association rules. FP(Frequent Pattern) growth algorithm propose compressed information needed to frequent item set in FP-tree and FP-tree are finds all frequent item. The idea of Attribute Based Access Control has existed for decades. It represents a point inside the area of logical access manage that incorporates access control records, role based totally get right of entry to manage, and the ABAC approach for giving get right of entry to based on the evaluation of attributes. It gives a excessive level of adaptability that provide safety and information sharing. algorithms have an ability to reduce the cost of migration to ABAC, by in part automating the improvement of an ABAC coverage from an access control list policy or role-based access control policy with accompanying characteristic records. Paper shows ABAC policy mining algorithm. this algorithm iterates over tuples and in user permission relation makes use of selected tuples uses as seeds for developing candidate guidelines, and endeavors to generalize every candidate rule for covering extra tuples within the consumer permission relation by changing conjuncts in characteristic expressions with constraints. The experimental end result suggests that the proposed gadget better in performance than the existing system.