Finding Collections of k-Clique Percolated Components in Attributed Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Finding Collections of k-Clique Percolated Components in Attributed Graphs

Abstract

In this paper, we consider graphs where a set of Boolean attributes is associated to each vertex, and we are interested in k-clique percolated components (components made of overlapping cliques) in such graphs. We propose the task of finding the collections of homogeneous k-clique percolated components, where homogeneity means sharing a common set of attributes having value true. A sound and complete algorithm based on subgraph enumeration is proposed. We report experiments on two real databases (a social network of scientific collaborations and a network of gene interactions), showing that the extracted patterns capture meaningful structures.
No file

Dates and versions

hal-00758843 , version 1 (29-11-2012)

Identifiers

  • HAL Id : hal-00758843 , version 1

Cite

Pierre-Nicolas Mougel, Christophe Rigotti, Olivier Gandrillon. Finding Collections of k-Clique Percolated Components in Attributed Graphs. Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), 2012, Kuala Lumpur, Malaysia. pp.181--192. ⟨hal-00758843⟩
197 View
0 Download

Share

Gmail Facebook X LinkedIn More