Abstract
The role mining process, i.e., computing minimal set of roles from a user-permission assignment relation, is rather incremental task. In a usual situation the set of roles is already established, and the existing permissions are evolved according to current needs. Computation of roles from scratch after each small change in the data is inefficient. Surprisingly, no incremental algorithm for role mining problem exists. The paper proposes a first attempt to an incremental algorithm for role mining problem. The algorithm is tested with several real-world datasets. The results show that the proposed algorithm is significantly faster than non-incremental algorithms, and in many cases, produces a smaller number of roles than the non-incremental version of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
