Finding maximal homogeneous clique sets - Archive ouverte HAL Access content directly
Journal Articles Knowledge and Information Systems (KAIS) Year : 2014

Finding maximal homogeneous clique sets

(1) , (2, 1, 3) , (1) , (4, 5)


Many datasets can be encoded as graphs with sets of labels associated with the vertices. We consider this kind of graphs and we propose to look for patterns called maximal homogeneous clique sets, where such a pattern is a subgraph that is structured in several large cliques and where all vertices share enough labels. We present an algorithm based on graph enumeration to compute all patterns satisfying user-defined constraints on the number of separated cliques, on the size of these cliques, and on the number of labels shared by all the vertices. Our approach is tested on real datasets based on a social network of scientific collaborations and on a biological network of protein-protein interactions. The experiments show that the patterns are useful to exhibit subgraphs organized in several core modules of interactions. Performances are reported on real data and also on synthetic ones, showing that the approach can be applied on different kinds of large datasets.
Not file

Dates and versions

hal-00827164 , version 1 (28-05-2013)



Pierre-Nicolas Mougel, Christophe Rigotti, Marc Plantevit, Olivier Gandrillon. Finding maximal homogeneous clique sets. Knowledge and Information Systems (KAIS), 2014, 39 (3), pp.579-608. ⟨10.1007/s10115-013-0625-y⟩. ⟨hal-00827164⟩
310 View
0 Download



Gmail Facebook Twitter LinkedIn More