--- name: building-role-mining-for-rbac-optimization-05dcf7eb827d description: Apply bottom-up and top-down role mining techniques, including clustering algorithms and formal concept analysis, to discover optimal RBAC roles from existing user-permission assignments, consolidating overlapping roles and enforcing least privilege. Use when an identity program needs to reduce role explosion or redesign its RBAC role set from access data. domain: cybersecurity subdomain: identity-access-management tags: - rbac - role-mining - identity-governance - access-control - least-privilege - clustering version: '1.0' author: mahipal license: Apache-2.0 nist_csf: - PR.AA-01 - PR.AA-02 - PR.AA-05 - PR.AA-06 mitre_attack: - T1078 - T1098 - T1069 --- # Building Role Mining for RBAC Optimization ## Overview Role mining is the process of analyzing existing user-permission assignments to discover optimal roles for a Role-Based Access Control (RBAC) system. Organizations accumulate excessive permissions over time through job changes, project assignments, and ad-hoc access grants, leading to "role explosion" where thousands of granular roles exist with significant overlap. Role mining uses data analysis -- including clustering algorithms, formal concept analysis, and graph-based methods -- to consolidate permissions into a minimal set of roles that accurately represent business functions while enforcing least privilege. ## When to Use - When deploying or configuring building role mining for rbac optimization capabilities in your environment - When establishing security controls aligned to compliance requirements - When building or improving security architecture for this domain - When conducting security assessments that require this implementation ## Prerequisites - Export of current user-permission assignments (CSV/database) - Identity governance platform or directory service access - Python 3.9+ with pandas, scikit-learn, numpy - Understanding of organizational structure and job functions - Stakeholder access for role validation workshops ## Core Concepts ### Role Mining Approaches | Approach | Description | Best For | |----------|-------------|----------| | Bottom-Up | Analyze existing permissions to discover common patterns | Large datasets with organic permission growth | | Top-Down | Design roles from business requirements and job descriptions | Greenfield RBAC or organizational restructuring | | Hybrid | Combine bottom-up analysis with top-down business validation | Most production environments | ### Role Mining Algorithms **1. Permission Clustering**: Group users with similar permission sets using k-means or hierarchical clustering. Users in the same cluster share a common role. **2. Formal Concept Analysis (FCA)**: Mathematical framework that identifies complete set of concepts (user groups sharing exact permission sets) from a binary user-permission matrix. **3. Graph-Based Mining**: Model users and permissions as a bipartite graph, then find dense subgraphs representing candidate roles. **4. Boolean Matrix Decomposition**: Decompose the user-permission matrix U into U ≈ R × P where R maps users to roles and P maps roles to permissions. ### Role Mining Metrics | Metric | Formula | Target | |--------|---------|--------| | Role Count | Total distinct roles after mining | Minimize | | Coverage | Permissions explained by mined roles / Total permissions | > 95% | | Weighted Structural Complexity (WSC) | Sum of role-user + role-permission assignments | Minimize | | Deviation | Extra permissions not covered by assigned roles | < 5% | ## Workflow ### Step 1: Extract User-Permission Data Collect the current access state from all identity sources: ```python import pandas as pd import numpy as np # Load user-permission assignments # Format: user_id, permission_id (one row per assignment) assignments = pd.read_csv("user_permissions.csv") # Create binary user-permission matrix (UPA matrix) upa_matrix = assignments.pivot_table( index="user_id", columns="permission_id", aggfunc="size", fill_value=0 ) upa_matrix = (upa_matrix > 0).astype(int) print(f"Users: {upa_matrix.shape[0]}") print(f"Permissions: {upa_matrix.shape[1]}") print(f"Assignments: {assignments.shape[0]}") print(f"Density: {upa_matrix.values.sum() / upa_matrix.size:.2%}") ``` ### Step 2: Bottom-Up Role Discovery Using Clustering ```python from sklearn.cluster import AgglomerativeClustering from sklearn.metrics import silhouette_score def find_optimal_clusters(matrix, max_k=50): """Find optimal number of roles using silhouette analysis.""" scores = [] for k in range(2, min(max_k, matrix.shape[0])): clustering = AgglomerativeClustering( n_clusters=k, metric="jaccard", linkage="average" ) labels = clustering.fit_predict(matrix) score = silhouette_score(matrix, labels, metric="jaccard") scores.append((k, score)) optimal_k = max(scores, key=lambda x: x[1])[0] return optimal_k, scores def mine_roles_clustering(upa_matrix, n_clusters): """Mine roles using hierarchical clustering on Jaccard distance.""" clustering = AgglomerativeClustering( n_clusters=n_clusters, metric="jaccard", linkage="average" ) user_matrix = upa_matrix.values labels = clustering.fit_predict(user_matrix) roles = {} for cluster_id in range(n_clusters): cluster_users = upa_matrix.index[labels == cluster_id] cluster_permissions = upa_matrix.loc[cluster_users] # Core role = permissions held by >80% of cluster members permission_frequency = cluster_permissions.mean() core_permissions = permission_frequency[permission_frequency >= 0.8].index.tolist() roles[f"Role_{cluster_id}"] = { "permissions": core_permissions, "user_count": len(cluster_users), "users": cluster_users.tolist(), "coverage": permission_frequency[permission_frequency >= 0.8].mean() } return roles, labels ``` ### Step 3: Formal Concept Analysis ```python def mine_roles_fca(upa_matrix, min_support=3): """Mine roles using Formal Concept Analysis (frequent closed itemsets).""" from itertools import combinations users = upa_matrix.index.tolist() permissions = upa_matrix.columns.tolist() concepts = [] # Find all maximal permission sets shared by at least min_support users for size in range(len(permissions), 0, -1): for perm_combo in combinations(permissions, size): perm_set = set(perm_combo) # Find users who have ALL permissions in this set matching_users = [] for user in users: user_perms = set(upa_matrix.columns[upa_matrix.loc[user] == 1]) if perm_set.issubset(user_perms): matching_users.append(user) if len(matching_users) >= min_support: # Check if this is a closed concept (no superset with same extent) is_closed = True for concept in concepts: if set(matching_users) == set(concept["users"]) and \ perm_set.issubset(set(concept["permissions"])): is_closed = False break if is_closed: concepts.append({ "permissions": list(perm_set), "users": matching_users, "support": len(matching_users) }) if len(concepts) > 100: # Limit for performance break return concepts ``` ### Step 4: Evaluate and Select Roles ```python def evaluate_role_set(roles, upa_matrix): """Evaluate the quality of a mined role set.""" total_assignments = upa_matrix.values.sum() covered_assignments = 0 extra_assignments = 0 for role_name, role_data in roles.items(): role_perms = set(role_data["permissions"]) for user in role_data["users"]: user_perms = set(upa_matrix.columns[upa_matrix.loc[user] == 1]) covered = role_perms.intersection(user_perms) extra = role_perms - user_perms covered_assignments += len(covered) extra_assignments += len(extra) metrics = { "total_roles": len(roles), "total_assignments": total_assignments, "covered_assignments": covered_assignments, "coverage_rate": covered_assignments / total_assignments if total_assignments else 0, "extra_permissions": extra_assignments, "deviation_rate": extra_assignments / (covered_assignments + extra_assignments) if (covered_assignments + extra_assignments) else 0, "avg_role_size": np.mean([len(r["permissions"]) for r in roles.values()]), "avg_users_per_role": np.mean([r["user_count"] for r in roles.values()]), } return metrics ``` ### Step 5: Business Validation After mining candidate roles: 1. Map mined roles to business functions (department, job title) 2. Conduct workshops with business unit managers to validate role definitions 3. Identify outlier permissions that indicate misconfiguration 4. Refine roles based on feedback and re-evaluate metrics 5. Document role definitions with business justification ## Validation Checklist - [ ] User-permission matrix extracted from all identity sources - [ ] Multiple mining algorithms compared (clustering, FCA) - [ ] Optimal role count determined via silhouette analysis or WSC - [ ] Coverage rate exceeds 95% of existing assignments - [ ] Deviation rate below 5% (minimal extra permissions) - [ ] Mined roles validated with business stakeholders - [ ] Role hierarchy defined (parent-child inheritance) - [ ] Exception/outlier permissions documented - [ ] Migration plan created for transitioning to new role model - [ ] Ongoing role governance process defined ## References - [Role Mining: Optimizing RBAC - NIST](https://csrc.nist.gov/projects/role-based-access-control) - [RBAC Standard - ANSI/INCITS 359-2012](https://www.incits.org/) - [Formal Concept Analysis for Role Engineering](https://link.springer.com/chapter/10.1007/978-3-540-73070-6_7) - [scikit-learn Clustering Documentation](https://scikit-learn.org/stable/modules/clustering.html) --- Source attribution: hironow Original project: https://github.com/hironow/cyber/blob/20efb3a6a2a9e7ebbde38ed32325979866110540/.agents/skills/building-role-mining-for-rbac-optimization/SKILL.md License: Apache-2.0 License information: https://www.apache.org/licenses/LICENSE-2.0 Original upstream instructions; downloaded from Mega AI Hub. ## Upstream license notice Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to the Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by the Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding any notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. Please do not remove or change the license header comment from a contributed file except when necessary. Copyright 2026 mukul975 Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. # Mega AI Hub resource metadata Creator / publisher: hironow Original project: https://github.com/hironow/cyber/blob/20efb3a6a2a9e7ebbde38ed32325979866110540/.agents/skills/building-role-mining-for-rbac-optimization/SKILL.md Attribution basis: Source repository record Fields of work: Data & Analytics, Development & Engineering, Operations Roles: Business Process Analyst, Data Analyst, Security Engineer Specialties: API, Database Tools: Python Country applicability: Country not specified Classification basis: Source catalog labels Instruction SHA-256: 287b25025e8807f709c841380a924167a910fdc3f31e53b63364b55c3d4478b8