2015
DOI: 10.1002/cpe.3456
|View full text |Cite
|
Sign up to set email alerts
|

Role mining based on cardinality constraints

Abstract: SUMMARYRole mining was recently proposed to automatically find roles among user-permission assignments using data mining technologies. However, the current studies about role mining mainly focus on how to find roles, without considering the constraints that are essentially required in role-based access control systems. In this paper, we present a role mining algorithm with constraints, especially for the cardinality constraints. We illustrate it is essential for role mining to take cardinality constraints into… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 26 publications
0
7
0
Order By: Relevance
“…Last but not the least, a role mining approach to automatically find roles among user‐permission assignments has been introduced in Role Mining Based on Cardinality Constraints. This paper has presented a role mining algorithm with cardinality constraints . The experimental results demonstrated the rationality and effectiveness of the proposed algorithm.…”
mentioning
confidence: 85%
“…Last but not the least, a role mining approach to automatically find roles among user‐permission assignments has been introduced in Role Mining Based on Cardinality Constraints. This paper has presented a role mining algorithm with cardinality constraints . The experimental results demonstrated the rationality and effectiveness of the proposed algorithm.…”
mentioning
confidence: 85%
“…In this way, we ensure that all permissions represented by candidateRole have been assigned to at most t − 1 roles, satisfying in this way the PDCC constraint. If all permissions in uncP erms have been already assigned to at least t − 1 roles (equivalently, see line 19, candidateRole is empty), then we form a role consisting of a unique permission randomly chosen in uncP erms and increment by one the number of roles it has been assigned to (see lines [19][20][21][22][23]. Notice that any permission will never be assigned by pickRole-PDCC 1 to more than t roles; indeed permission p j is assigned to a role either in line 13 or in line 21.…”
Section: Pdcc Heuristicsmentioning
confidence: 99%
“…The heuristic selects only permission vertices covering the highest number of possible uncovered incident edges, respecting at each iteration the permissiondistribution cardinality constraint. Li et al [21] also proposed a heuristic considering PDCC constraints. Their approach is based on the graph optimization theory described by Zhang et al in [36].…”
Section: Pdcc Heuristicsmentioning
confidence: 99%
See 1 more Smart Citation
“…According to Ye et al [4], RBAC system could be implemented through two approaches specifically the top-down and the bottom-up method. The authors have explained that the top-down approach builds a RBAC system with the involvement of experts' analysis on the business processes yet, this approach consumes a lot of time because of human participation [7]. The bottom-up approach, according to Hu et al [8] can uncover roles from the existing user-permission assignments (UPA) automatically that is known as role mining and because of its nature that based on computing-intensive approach, it is widely applied to build a RBAC model.…”
Section: Literature Reviewmentioning
confidence: 99%