Sciweavers

128 search results - page 13 / 26
» On Mining Closed Sets in Multi-Relational Data
Sort
View
69
Voted
DMKD
2003
ACM
96views Data Mining» more  DMKD 2003»
15 years 2 months ago
Using transposition for pattern discovery from microarray data
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biol...
François Rioult, Jean-François Bouli...
CCS
2009
ACM
15 years 4 months ago
A probabilistic approach to hybrid role mining
Role mining algorithms address an important access control problem: configuring a role-based access control system. Given a direct assignment of users to permissions, role mining...
Mario Frank, Andreas P. Streich, David A. Basin, J...
ICFCA
2009
Springer
15 years 4 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
KAIS
2010
139views more  KAIS 2010»
14 years 8 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
PKDD
2005
Springer
117views Data Mining» more  PKDD 2005»
15 years 3 months ago
A Bi-clustering Framework for Categorical Data
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both...
Ruggero G. Pensa, Céline Robardet, Jean-Fra...