Mining Convex Polygon Patterns with Formal Concept Analysis

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01573841
Contributor : Mehdi Kaytoue <>
Submitted on : Thursday, August 10, 2017 - 5:01:17 PM
Last modification on : Tuesday, November 19, 2019 - 2:41:58 AM

File

ijcai17.pdf
Files produced by the author(s)

Identifiers

Citation

Aimene Belfodil, Sergei 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⟩

Share

Metrics

Record views

260

Files downloads

498