Frequent Submap Discovery - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Frequent Submap Discovery


Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjacency relationships between these cells. In particular, they can be used to model the topology of plane graphs. In this paper, we describe an algorithm, called mSpan, for extracting patterns which occur frequently in a database of maps. We experimentally compare mSpan with gSpan on a synthetic database of randomly generated 2D and 3D maps. We show that gSpan does not extract the same patterns, as it only considers adjacency relationships between cells. We also show that mSpan exhibits nicer scale-up properties when increasing map sizes or when decreasing frequency.
Fichier principal
Vignette du fichier
CPM2011.pdf (312.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00636373 , version 1 (27-10-2011)



Stéphane Gosselin, Guillaume Damiand, Christine Solnon. Frequent Submap Discovery. Symposium on Combinatorial Pattern Matching, Jun 2011, Palermo, Italy. pp.429-440, ⟨10.1007/978-3-642-21458-5_36⟩. ⟨hal-00636373⟩
328 View
231 Download



Gmail Facebook Twitter LinkedIn More