{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:50:01Z","timestamp":1770227401855,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T00:00:00Z","timestamp":1654560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Leverhulme Foundation","award":["RPG-2018-161"],"award-info":[{"award-number":["RPG-2018-161"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,7]]},"DOI":"10.1145\/3532105.3535024","type":"proceedings-article","created":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T14:29:57Z","timestamp":1654698597000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Generalized Noise Role Mining"],"prefix":"10.1145","author":[{"given":"Jason","family":"Crampton","sequence":"first","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduard","family":"Eiben","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Karapetyan","sequence":"additional","affiliation":[{"name":"University of Nottingham, Nottingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diptapriyo","family":"Majumdar","sequence":"additional","affiliation":[{"name":"Indraprastha Institute of Information Technology Delhi (IIITD), New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (LIPIcs","volume":"16","author":"Dan Chen","year":"2018","unstructured":"Chen Dan , Kristoffer Arnsfelt Hansen , He Jiang , Liwei Wang , and Yuchen Zhou . 2018 . Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (LIPIcs , Vol. 117), Igor Potapov, Paul G. Spirakis, and James Worrell (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 41:1--41: 16 . Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, and Yuchen Zhou. 2018. Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (LIPIcs, Vol. 117), Igor Potapov, Paul G. Spirakis, and James Worrell (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 41:1--41:16."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/501978.501980"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-019-00669-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0895"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90006-6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Jafar Haadi Jafarian Hassan Takabi Hakim Touati Ehsan Hesamifard and Mohamed Shehab. 2015. Towards a General Framework for Optimal Role Mining: A Constraint Satisfaction Approach. In SACMAT. ACM 211--220.  Jafar Haadi Jafarian Hassan Takabi Hakim Touati Ehsan Hesamifard and Mohamed Shehab. 2015. Towards a General Framework for Optimal Role Mining: A Constraint Satisfaction Approach. In SACMAT. ACM 211--220.","DOI":"10.1145\/2752952.2752975"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11339"},{"key":"e_1_3_2_1_8_1","volume-title":"Boolean Matrix Theory and Applications. Monographs and Textbooks in Pure and Applied Mathematics","author":"Kim Ki Hang","unstructured":"Ki Hang Kim . 1982. Boolean Matrix Theory and Applications. Monographs and Textbooks in Pure and Applied Mathematics , Vol. 70 . Marcel Dekker , New York . Ki Hang Kim. 1982. Boolean Matrix Theory and Applications. Monographs and Textbooks in Pure and Applied Mathematics, Vol. 70. Marcel Dekker, New York."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386599"},{"key":"e_1_3_2_1_10_1","volume-title":"Optimal Boolean Matrix Decomposition: Application to Role Engineering","author":"Lu Haibing","unstructured":"Haibing Lu , Jaideep Vaidya , and Vijayalakshmi Atluri . 2008. Optimal Boolean Matrix Decomposition: Application to Role Engineering . In ICDE. IEEE Computer Society , 297--306. Haibing Lu, Jaideep Vaidya, and Vijayalakshmi Atluri. 2008. Optimal Boolean Matrix Decomposition: Application to Role Engineering. In ICDE. IEEE Computer Society, 297--306."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2590636.2590637"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2871148"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Ian M. Molloy Ninghui Li Tiancheng Li Ziqing Mao Qihua Wang and Jorge Lobo. 2009. Evaluating role mining algorithms. In SACMAT. ACM 95--104.  Ian M. Molloy Ninghui Li Tiancheng Li Ziqing Mao Qihua Wang and Jorge Lobo. 2009. Evaluating role mining algorithms. In SACMAT. ACM 95--104.","DOI":"10.1145\/1542207.1542224"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Ian M. Molloy Ninghui Li Yuan (Alan) Qi Jorge Lobo and Luke Dickens. 2010. Mining roles with noisy data. In SACMAT. ACM 45--54.  Ian M. Molloy Ninghui Li Yuan (Alan) Qi Jorge Lobo and Luke Dickens. 2010. Mining roles with noisy data. In SACMAT. ACM 45--54.","DOI":"10.1145\/1809842.1809852"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Gustaf Neumann and Mark Strembeck. 2002. A scenario-driven role engineering process for functional RBAC roles. In SACMAT. ACM 33--42.  Gustaf Neumann and Mark Strembeck. 2002. A scenario-driven role engineering process for functional RBAC roles. In SACMAT. ACM 33--42.","DOI":"10.1145\/507711.507717"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.485845"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22348-8_8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2008.61"}],"event":{"name":"SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies","location":"New York NY USA","acronym":"SACMAT '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 27th ACM on Symposium on Access Control Models and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532105.3535024","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3532105.3535024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:14Z","timestamp":1750183754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532105.3535024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,7]]},"references-count":18,"alternative-id":["10.1145\/3532105.3535024","10.1145\/3532105"],"URL":"https:\/\/doi.org\/10.1145\/3532105.3535024","relation":{},"subject":[],"published":{"date-parts":[[2022,6,7]]},"assertion":[{"value":"2022-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}