An incremental algorithm for the role mining problem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F20%3A73601616" target="_blank" >RIV/61989592:15310/20:73601616 - isvavai.cz</a>

Result on the web

<a href="https://www.sciencedirect.com/science/article/pii/S0167404820301036" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0167404820301036</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.cose.2020.101830" target="_blank" >10.1016/j.cose.2020.101830</a>

Result language

angličtina

Original language name

An incremental algorithm for the role mining problem

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

COMPUTERS &amp; SECURITY

ISSN

0167-4048

e-ISSN

—

Volume of the periodical

94

Issue of the periodical within the volume

JUL

Country of publishing house

GB - UNITED KINGDOM

Number of pages

9

Pages from-to

"101830-1"-"101830-9"

UT code for WoS article

000536764600003

EID of the result in the Scopus database

2-s2.0-85083755707