메뉴 건너뛰기




Volumn , Issue , 2010, Pages 45-54

Mining roles with noisy data

Author keywords

Approximation; Noise; Prediction; RBAC; Role mining

Indexed keywords

APPROXIMATION; AUTOMATIC TECHNIQUE; INPUT DATAS; MISSING VALUES; NOISE PREDICTIONS; NOISE REMOVAL; NOISY DATA; NON-BINARY; REDUCED MATRIX; ROLE ENGINEERING; ROLE-BASED ACCESS CONTROL; TWO-STEP APPROACH;

EID: 77954945655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1809842.1809852     Document Type: Conference Paper
Times cited : (53)

References (22)
  • 1
    • 57349099221 scopus 로고    scopus 로고
    • Detecting and resolving policy misconfigurations in access-control systems
    • L. Bauer, S. Garriss, and M. K. Reiter. Detecting and resolving policy misconfigurations in access-control systems. In SACMAT'08, pages 185-194, 2008.
    • (2008) SACMAT'08 , pp. 185-194
    • Bauer, L.1    Garriss, S.2    Reiter, M.K.3
  • 4
    • 70049099334 scopus 로고    scopus 로고
    • A class of probabilistic models for role engineering
    • M. Frank, D. A. Basin, and J. M. Buhmann. A class of probabilistic models for role engineering. In CCS'08, pages 299-310, 2008.
    • (2008) CCS'08 , pp. 299-310
    • Frank, M.1    Basin, D.A.2    Buhmann, J.M.3
  • 5
    • 74049139498 scopus 로고    scopus 로고
    • A probabilistic approach to hybrid role mining
    • M. Frank, A. P. Streich, D. Basin, and J. M. Buhmann. A probabilistic approach to hybrid role mining. In CCS'09, pages 101-111, 2009.
    • (2009) CCS'09 , pp. 101-111
    • Frank, M.1    Streich, A.P.2    Basin, D.3    Buhmann, J.M.4
  • 7
    • 33745052298 scopus 로고    scopus 로고
    • Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
    • M. Koyutürk, A. Grama, and N. Ramakrishnan. Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis. ACM Trans. Math. Softw., 32(1):33-69, 2006.
    • (2006) ACM Trans. Math. Softw. , vol.32 , Issue.1 , pp. 33-69
    • Koyutürk, M.1    Grama, A.2    Ramakrishnan, N.3
  • 8
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(83-97), 1955.
    • (1955) Naval Research Logistics Quarterly , vol.2 , Issue.83-97
    • Kuhn, H.W.1
  • 9
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by non-negative matrix factorization
    • Oct
    • D. Lee and H. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755):788-791, Oct 1999.
    • (1999) Nature , vol.401 , Issue.6755 , pp. 788-791
    • Lee, D.1    Seung, H.2
  • 10
    • 48349103211 scopus 로고    scopus 로고
    • Optimal Boolean matrix decomposition: Application to role engineering
    • H. Lu, J. Vaidya, and V. Atluri. Optimal boolean matrix decomposition: Application to role engineering. In ICDE'08, pages 297-306, 2008.
    • (2008) ICDE'08 , pp. 297-306
    • Lu, H.1    Vaidya, J.2    Atluri, V.3
  • 13
    • 70450284416 scopus 로고    scopus 로고
    • Automating role-based provisioning by learning from examples
    • Q. Ni, J. Lobo, S. Calo, P. Rohatgi, and E. Bertino. Automating role-based provisioning by learning from examples. In SACMAT'09, pages 75-84, 2009.
    • (2009) SACMAT'09 , pp. 75-84
    • Ni, Q.1    Lobo, J.2    Calo, S.3    Rohatgi, P.4    Bertino, E.5
  • 17
    • 65449121541 scopus 로고    scopus 로고
    • Relational learning via collective matrix factorization
    • A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. In KDD'08, 2008.
    • (2008) KDD'08
    • Singh, A.P.1    Gordon, G.J.2
  • 18
    • 56049086197 scopus 로고    scopus 로고
    • A unified view of matrix factorization models
    • A. P. Singh and G. J. Gordon. A unified view of matrix factorization models. In ECML/PKDD (2), pages 358-373, 2008.
    • (2008) ECML/PKDD , Issue.2 , pp. 358-373
    • Singh, A.P.1    Gordon, G.J.2
  • 19
    • 71149085556 scopus 로고    scopus 로고
    • Multi-assignment clustering for Boolean data
    • A. P. Streich, M. Frank, D. Basin, and J. M. Buhmann. Multi-assignment clustering for boolean data. In ICML'09, pages 969-976, 2009.
    • (2009) ICML'09 , pp. 969-976
    • Streich, A.P.1    Frank, M.2    Basin, D.3    Buhmann, J.M.4
  • 20
    • 34548052480 scopus 로고    scopus 로고
    • The role mining problem: Finding a minimal descriptive set of roles
    • J. Vaidya, V. Atluri, and Q. Guo. The role mining problem: Finding a minimal descriptive set of roles. In SACMAT'07, pages 175-184, 2007.
    • (2007) SACMAT'07 , pp. 175-184
    • Vaidya, J.1    Atluri, V.2    Guo, Q.3
  • 21
    • 57349117050 scopus 로고    scopus 로고
    • Migrating to optimal RBAC with minimal perturbation
    • J. Vaidya, V. Atluri, Q. Guo, and N. Adam. Migrating to optimal RBAC with minimal perturbation. In SACMAT'08, pages 11-20, 2008.
    • (2008) SACMAT'08 , pp. 11-20
    • Vaidya, J.1    Atluri, V.2    Guo, Q.3    Adam, N.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.