A survey of role mining
Role-Based Access Control (RBAC) is the most widely used model for advanced access
control deployed in diverse enterprises of all sizes. RBAC critically depends on defining …
control deployed in diverse enterprises of all sizes. RBAC critically depends on defining …
Frequent item set mining
C Borgelt - Wiley interdisciplinary reviews: data mining and …, 2012 - Wiley Online Library
Frequent item set mining is one of the best known and most popular data mining methods.
Originally developed for market basket analysis, it is used nowadays for almost any task that …
Originally developed for market basket analysis, it is used nowadays for almost any task that …
Krimp: mining itemsets that compress
J Vreeken, M Van Leeuwen, A Siebes - Data Mining and Knowledge …, 2011 - Springer
One of the major problems in pattern mining is the explosion of the number of results. Tight
constraints reveal only common knowledge, while loose constraints lead to an explosion in …
constraints reveal only common knowledge, while loose constraints lead to an explosion in …
The role mining problem: finding a minimal descriptive set of roles
Devising a complete and correct set of roles has been recognized as one of the most
important and challenging tasks in implementing role based access control. A key problem …
important and challenging tasks in implementing role based access control. A key problem …
Discovery of optimal factors in binary data via a novel method of matrix decomposition
R Belohlavek, V Vychodil - Journal of Computer and System Sciences, 2010 - Elsevier
We present a novel method of decomposition of an n× m binary matrix I into a Boolean
product A○ B of an n× k binary matrix A and ak× m binary matrix B with k as small as …
product A○ B of an n× k binary matrix A and ak× m binary matrix B with k as small as …
The discrete basis problem
Matrix decomposition methods represent a data matrix as a product of two factor matrices:
one containing basis vectors that represent meaningful concepts in the data, and another …
one containing basis vectors that represent meaningful concepts in the data, and another …
Fast exact and heuristic methods for role minimization problems
We describe several new bottom-up approaches to problems in role engineering for Role-
Based Access Control (RBAC). The salient problems are all NP-complete, even to …
Based Access Control (RBAC). The salient problems are all NP-complete, even to …
Size bounds for factorised representations of query results
We study two succinct representation systems for relational data based on relational algebra
expressions with unions, Cartesian products, and singleton relations: f-representations …
expressions with unions, Cartesian products, and singleton relations: f-representations …
Fast and reliable anomaly detection in categorical data
Spotting anomalies in large multi-dimensional databases is a crucial task with many
applications in finance, health care, security, etc. We introduce COMPREX, a new approach …
applications in finance, health care, security, etc. We introduce COMPREX, a new approach …
Maximum entropy models and subjective interestingness: an application to tiles in binary databases
T De Bie - Data Mining and Knowledge Discovery, 2011 - Springer
Recent research has highlighted the practical benefits of subjective interestingness
measures, which quantify the novelty or unexpectedness of a pattern when contrasted with …
measures, which quantify the novelty or unexpectedness of a pattern when contrasted with …