With the proliferation of mobile devices and wireless communications, Location-Based Social Networks (LBSNs) have seen tremendous growth. Location recommendation, as an important service in LBSNs, can provide users with locations of interest by analyzing their complex check-in information. Currently, most location recommendations use centralized learning strategies, which carry the risk of user privacy breaches. As an emerging learning strategy, federated learning is widely applied in the field of location recommendation to address privacy concerns. We propose a Federated Learning-Based Location Similarity Model for Location Privacy Preserving Recommendation (FedLSM-LPR) scheme. First, the location-based similarity model is used to capture the differences between locations and make location recommendations. Second, the penalty term is added to the loss function to constrain the distance between the local model parameters and the global model parameters. Finally, we use the REPAgg method, which is based on clustering for client selection, to perform global model aggregation to address data heterogeneity issues. Extensive experiments demonstrate that the proposed FedLSM-LPR scheme not only delivers superior performance but also effectively protects the privacy of users.

Role-based access control (RBAC) is a widely adopted access control model in various domains for defining security management. Role mining is closely related to role-based access control, as the latter employs role assignments to offer a flexible and scalable approach to managing permissions within an organization. The edge role mining problem (Edge RMP), a variant of the role mining problem (RMP), has long been recognized as an effective strategy for role assignment. Role mining, which groups users with similar access permissions into the same role, bears some resemblance to symmetry. Symmetry categorizes objects or graphics with identical characteristics into one group. Both involve a certain form of “classification” or “induction”. Edge-RMP reduces the associations between users and permissions, thereby lowering the security risks faced by the system. While an algorithm based on Boolean matrix factorization exists for this problem, it fails to further refine the resulting user–role assignment (UA) and role–permission assignment (PA) relationships. Additionally, this algorithm does not address constraint-related issues, such as cardinality constraints, user exclusion constraints, and user capabilities. Furthermore, it demonstrates significant redundancy of roles when handling large datasets, leaving room for further optimization of Edge-RMP results. To address these concerns, this paper proposes the MFC-RMA algorithm based on Boolean matrix factorization. The method achieves significant optimization of Edge-RMP results by handling relationships between roles possessing various permissions. Furthermore, this paper clusters, compresses, modifies, and optimizes the original data based on the similarity between users, ensuring its usability for role mining. Both theoretical and practical considerations are taken into account for different types of constraints, and algorithms are devised to reallocate roles incorporating these constraints, thereby generating UA and PA matrices. The proposed approach yields optimal numbers of generated roles and the sum of the minimum number of generated edges to address the aforementioned issues. Experimental results demonstrate that the algorithm reduces management overhead, provides efficient execution results, and ensures the accuracy of generated roles.