The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
The role mining problem: finding a minimal descriptive set of roles
Abstract
Devising a complete and correct of roles has been recognized as one of the most important and challenging tasks in implementing role based access control. A key related to this is the notion of goodness/interestingness -- when is a role good/interesting? In this paper, we define the role mining (RMP) as the of discovering an optimal of roles from existing user permissions. The main contribution of this paper 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 δ-approx RMP and the 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 paper is also to show the relation of the role mining 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Role-based access control models
Sandhu, R. S., Coyne, E. J., Feinstein, H. L., & Youman, C. E. (1996) · Computer · doi:10.1109/2.485845 · Cited by 5,892
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
Proposed NIST standard for role-based access control
Ferraiolo, D. F., Sandhu, R., Gavrila, S., Kuhn, D. R., & Chandramouli, R. (2001) · ACM Transactions on Information and System Security · doi:10.1145/501978.501980 · Cited by 2,544
Mitzias, P., Riga, M., Waddington, S. N., Kontopoulos, E., Μεδίτσκος, Γ., Laurenson, P., & Kompatsiaris, I. Y. (2015) · Cited by 1,240
The maximum edge biclique problem is NP-complete
Peeters, R. (2003) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(03)00333-0 · Cited by 374
Geerts, F., Goethals, B., & Mielikäinen, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30214-8_22 · Cited by 178
Approximating Clique and Biclique Problems
Hochbaum, D. S. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0964 · Cited by 113
Miettinen, P., Mielikäinen, T., Gionis, A., Das, G., & Mannila, H. (2006) · Lecture notes in computer science · doi:10.1007/11871637_33 · Cited by 40
Cited by
Miettinen, P., Mielikainen, T., Gionis, A., Das, G., & Mannila, H. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.53 · Cited by 272
Metadata
- Authors
- Vaidya, J., Atluri, V., & Guo, Q.
- Venue
- Proceedings of the 12th ACM symposium on Access control models and technologies
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 175-184
- OpenAlex
- W2107801860
- Cited by
- 281
- References
- 11
- FWCI
- 52.12
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The role mining problem: finding a minimal descriptive set of roles. https://app.cochat.ai/papers/10.1145/1266840.1266870
- The paper
- Vaidya, J., Atluri, V., & Guo, Q. (2007). The role mining problem: finding a minimal descriptive set of roles. Proceedings of the 12th ACM symposium on Access control models and technologies. https://doi.org/10.1145/1266840.1266870
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.