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 patterns 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 for capturing high density areas in any pattern mining task. Our contribution is threefold: (i) We formally introduce such patterns in Formal Concept Analysis (FCA), (ii) we give all the basic bricks for mining polygons with exhaustive search and pattern sampling, and (iii) we design several algorithms that we compare experimentally.
Cite
Text
Belfodil et al. "Mining Convex Polygon Patterns with Formal Concept Analysis." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/197Markdown
[Belfodil et al. "Mining Convex Polygon Patterns with Formal Concept Analysis." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/belfodil2017ijcai-mining/) doi:10.24963/IJCAI.2017/197BibTeX
@inproceedings{belfodil2017ijcai-mining,
title = {{Mining Convex Polygon Patterns with Formal Concept Analysis}},
author = {Belfodil, Aimene and Kuznetsov, Sergei O. and Robardet, Céline and Kaytoue, Mehdi},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2017},
pages = {1425-1432},
doi = {10.24963/IJCAI.2017/197},
url = {https://mlanthology.org/ijcai/2017/belfodil2017ijcai-mining/}
}