作者: Pierre-Nicolas Mougel , Christophe Rigotti , Olivier Gandrillon
DOI: 10.1007/978-3-642-30220-6_16
关键词:
摘要: In this paper, we consider graphs where a set of Boolean attributes is associated to each vertex, and are interested in k -clique percolated components (components made overlapping cliques) such graphs. We propose the task finding collections homogeneous components, homogeneity means sharing common having value true. A sound complete algorithm based on subgraph enumeration proposed. report experiments two real databases (a social network scientific collaborations gene interactions), showing that extracted patterns capture meaningful structures.