基于概念格分层的角色最小化优化算法

ROLE MINIMIZATION OPTIMIZATION ALGORITHM BASED ON CONCEPT LATTICE HIERARCHY

针对角色挖掘中寻找最小角色集是NP难问题,提出一种基于概念格分层的角色最小化优化算法。先通过分层算法将概念格进行分层,然后利用层号得到查找算法的起始和截止位置。以对象概念集合为初始集,根据对象概念的层号自底向上逐层进行角色替代和约减,直到寻找到最小角色概念集。实验从时间复杂度和准确度进行对比,结果表明该算法是有效的,降低了算法的时间复杂度。

In view of the NP-hard problem of finding the minimum role set in role mining,this paper proposed an optimization algorithm for role minimization based on concept lattice hierarchy.We classified the concept lattice by layering algorithm,then used the layer number to get the starting and ending positions of the search algorithm.The object concept set was used as the initial set,and the role substitution and reduction were performed layer by layer according to the layer number of the object concept until the minimum role concept set was found.The experimental results are compared with time complexity and complexity,which show that the algorithm is effective and reduces the time complexity of the algorithm.