arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.16757cs.CRcs.AIcs.CC
收藏

角色挖掘中的双目标优化

Bi-objective Optimization in Role Mining

Royal Holloway, University of London(伦敦大学皇家霍洛威学院);University of Nottingham(诺丁汉大学);Indraprastha Institute of Information Technology Delhi(德里因陀罗普拉斯塔信息技术学院)

Jason Crampton, Eduard Eiben, Gregory Gutin, Daniel Karapetyan, Diptapriyo Majumdar

AI总结:

本文提出了广义噪声角色挖掘问题(GNRM)及其双目标优化变体(BO-GNRM),证明了其固定参数可处理性,并利用整数规划求解器 Gurobi 验证了该方法在真实授权策略上的有效性。

摘要:

角色挖掘是一种用于从现有策略中导出基于角色的授权策略的技术。给定一组用户 $U$、一组权限 $P$ 以及一个用户-权限授权关系 $\mathit{UPA}\subseteq U\times P$,角色挖掘算法旨在计算一组角色 $R$、一个用户-角色授权关系 $\mathit{UA}\subseteq U\times R$ 和一个权限-角色授权关系 $\mathit{PA}\subseteq R\times P$,使得 $\mathit{UA}$ 和 $\mathit{PA}$ 的组合在某种适当意义上接近 $\mathit{UPA}$。在本文中,我们首先引入了广义噪声角色挖掘问题(GNRM)——即 MinNoise Role Mining 问题的推广——我们认为该问题具有相当大的实际相关性。扩展 Fomin 等人的工作,我们证明了 GNRM 是固定参数可处理的,其参数为 $r + k$,其中 $r$ 是解中的角色数量,$k$ 是 $\mathit{UPA}$ 与由 $\mathit{UA}$ 和 $\mathit{PA}$ 组合所定义的关系之间的差异数量。我们进一步引入了 GNRM 的双目标优化变体,其中我们希望在满足上限 $r\le \bar{r}$ 和 $k\le \bar{k}$(其中 $\bar{r}$ 和 $\bar{k}$ 为常数)的条件下,同时最小化 $r$ 和 $k$。我们证明了该双目标优化问题(BO-GNRM)的 Pareto 前沿可以在以 $\bar{r}+\bar{k}$ 为参数的固定参数可处理时间内被计算出来。随后,我们报告了使用整数规划求解器 Gurobi 求解 BO-GNRM 实例的实验工作结果。我们的主要发现是: 我们获得了强有力的证据支持 Gurobi 的性能是固定参数可处理的; 基于我们在三种著名的真实世界授权策略背景下进行的实验,我们的结果表明我们的技术在实际角色挖掘中可能是有用的。

英文摘要:

Role mining is a technique used to derive a role-based authorization policy from an existing policy. Given a set of users $U$, a set of permissions $P$ and a user-permission authorization relation $\mahtit{UPA}\subseteq U\times P$, a role mining algorithm seeks to compute a set of roles $R$, a user-role authorization relation $\mathit{UA}\subseteq U\times R$ and a permission-role authorization relation $\mathit{PA}\subseteq R\times P$, such that the composition of $\mathit{UA}$ and $\mathit{PA}$ is close (in some appropriate sense) to $\mathit{UPA}$. In this paper, we first introduce the Generalized Noise Role Mining problem (GNRM) -- a generalization of the MinNoise Role Mining problem -- which we believe has considerable practical relevance. Extending work of Fomin et al., we show that GNRM is fixed parameter tractable, with parameter $r + k$, where $r$ is the number of roles in the solution and $k$ is the number of discrepancies between $\mathit{UPA}$ and the relation defined by the composition of $\mathit{UA}$ and $\mathit{PA}$. We further introduce a bi-objective optimization variant of GNRM, where we wish to minimize both $r$ and $k$ subject to upper bounds $r\le \bar{r}$ and $k\le \bar{k}$, where $\bar{r}$ and $\bar{k}$ are constants. We show that the Pareto front of this bi-objective optimization problem (BO-GNRM) can be computed in fixed-parameter tractable time with parameter $\bar{r}+\bar{k}$. We then report the results of our experimental work using the integer programming solver Gurobi to solve instances of BO-GNRM. Our key findings are that (a) we obtained strong support that Gurobi's performance is fixed-parameter tractable, (b) our results suggest that our techniques may be useful for role mining in practice, based on our experiments in the context of three well-known real-world authorization policies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑