Evaluating role mining algorithms

  • Authors:
  • Ian Molloy;Ninghui Li;Tiancheng Li;Ziqing Mao;Qihua Wang;Jorge Lobo

  • Affiliations:
  • Purdue University, West Lafayette, IN, USA;Purdue University, West Lafayette, IN, USA;Purdue University, West Lafayette, IN, USA;Purdue University, West Lafayette, IN, USA;Purdue University, West Lafayette, IN, USA;IBM T.J. Watson Research Center, Hawthorne, NY, USA

  • Venue:
  • Proceedings of the 14th ACM symposium on Access control models and technologies
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

While many role mining algorithms have been proposed in recent years, there lacks a comprehensive study to compare these algorithms. These role mining algorithms have been evaluated when they were proposed, but the evaluations were using different datasets and evaluation criteria. In this paper, we introduce a comprehensive framework for evaluating role mining algorithms. We categorize role mining algorithms into two classes based on their outputs; Class 1 algorithms output a sequence of prioritized roles while Class 2 algorithms output complete RBAC states. We then develop techniques that enable us to compare these algorithms directly. We also introduce a new role mining algorithm and two new ways for algorithmically generating datasets for evaluation. Using synthetic as well as real datasets, we compared nine role mining algorithms. Our results illustrate the strengths and weaknesses of these algorithms.