Entry Vaidya:2010:RMP from tissec.bib

Last update: Sun Oct 15 02:58:48 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Vaidya:2010:RMP,
  author =       "Jaideep Vaidya and Vijayalakshmi Atluri and Qi Guo",
  title =        "The role mining problem: a formal perspective",
  journal =      j-TISSEC,
  volume =       "13",
  number =       "3",
  pages =        "27:1--27:??",
  month =        jul,
  year =         "2010",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1805974.1895983",
  ISSN =         "1094-9224 (print), 1557-7406 (electronic)",
  ISSN-L =       "1094-9224",
  bibdate =      "Wed Jul 28 14:57:15 MDT 2010",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/tissec.bib",
  abstract =     "Devising a complete and correct set of roles has been
                 recognized as one of the most important and challenging
                 tasks in implementing role-based access control. A key
                 problem related to this is the notion of
                 goodness/interestingness --- when is a role
                 good/interesting? In this article, we define the {\em
                 Role Mining Problem\/} (RMP) as the problem of
                 discovering an optimal set of roles from existing user
                 permissions. The main contribution of this article is
                 to formally define RMP and analyze its theoretical
                 bounds. In addition to the above basic RMP, we
                 introduce two different variations of the RMP, called
                 the {\em $\delta$-Approx RMP\/} and the {\em
                 minimal-noise RMP\/} that have pragmatic implications.
                 We reduce the known ``Set Basis Problem'' to RMP to
                 show that RMP is an NP-complete problem. An important
                 contribution of this article is also to show the
                 relation of the RMP to several problems already
                 identified in the data mining and data analysis
                 literature. By showing that the RMP is in essence
                 reducible to these known problems, we can directly
                 borrow the existing implementation solutions and guide
                 further research in this direction. We also develop a
                 heuristic solution based on the previously proposed
                 FastMiner algorithm, which is very accurate and
                 efficient.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
  keywords =     "RBAC; role engineering; role mining",
}

Related entries