Mining exceptional closed patterns in attributed graphs - Archive ouverte HAL Access content directly
Journal Articles Knowledge and Information Systems (KAIS) Year : 2018

Mining exceptional closed patterns in attributed graphs

Anes Bendimerad
Marc Plantevit
Céline Robardet


Geo-located social media provide a large amount of information describing urban areas based on user descriptions and comments. Such data makes possible to identify meaningful city neighborhoods on the basis of the footprints left by a large and diverse population that uses this type of media. In this paper, we present some methods to exhibit the predominant activities and their associated urban areas to automatically describe a whole city. Based on a suitably attributed graph model, our approach identifies neighborhoods with homogeneous and exceptional characteristics. We introduce the novel problem of exceptional subgraph mining in attributed graphs and propose a complete algorithm that takes benefits from closure operators, new upper bounds and pruning properties. We also define an approach to sample the space of closed exceptional subgraphs within a given time-budget. Experiments performed on 10 real datasets are reported and demonstrate the relevancy of both approaches, and also show their limits.
Fichier principal
Vignette du fichier
Mining exceptional closed patterns in attributed graphs.pdf (5.3 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01625007 , version 1 (27-10-2017)



Anes Bendimerad, Marc Plantevit, Céline Robardet. Mining exceptional closed patterns in attributed graphs. Knowledge and Information Systems (KAIS), 2018, 56 (1), pp.1 - 25. ⟨10.1007/s10115-017-1109-2⟩. ⟨hal-01625007⟩
242 View
400 Download



Gmail Facebook Twitter LinkedIn More