Mining Convex Polygon Patterns with Formal Concept Analysis - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Mining Convex Polygon Patterns with Formal Concept Analysis


Pattern mining is an important task in AI for eliciting hypotheses from the data. When it comes to spatial data, the geo-coordinates are often considered independently as two different attributes. Consequently, rectangular shapes are searched for. Such an arbitrary form is not able to capture interesting regions in general. We thus introduce convex polygons, a good trade-off between expressiv-ity and algorithmic complexity. Our contribution is threefold: (i) We formally introduce such patterns in Formal Concept Analysis (FCA), (ii) we give all the basic bricks for mining convex polygons with exhaustive search and pattern sampling, and (iii) we design several algorithms, which we compare experimentally.
Fichier principal
Vignette du fichier
ijcai17.pdf (6.49 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01573841 , version 1 (10-08-2017)



Aimene Belfodil, Sergei O Kuznetsov, Céline Robardet, Mehdi Kaytoue. Mining Convex Polygon Patterns with Formal Concept Analysis. The Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI), Aug 2017, Melbourne, Australia. pp.1425 - 1432, ⟨10.24963/ijcai.2017/197⟩. ⟨hal-01573841⟩
286 View
307 Download



Gmail Facebook X LinkedIn More