Anytime Subgroup Discovery in Numerical Domains with Guarantees - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Anytime Subgroup Discovery in Numerical Domains with Guarantees

Aimene Belfodil
Adnene Belfodil
Mehdi Kaytoue


Subgroup discovery is the task of discovering patterns that accurately discriminate a class label from the others. Existing approaches can uncover such patterns either through an exhaustive or an approximate exploration of the pattern search space. However, an exhaustive exploration is generally unfeasible whereas approximate approaches do not provide guarantees bounding the error of the best pattern quality nor the exploration progression ("How far are we of an exhaustive search"). We design here an algorithm for mining numerical data with three key properties w.r.t. the state of the art: (i) It yields progressively interval patterns whose quality improves over time; (ii) It can be interrupted anytime and always gives a guarantee bounding the error on the top pattern quality and (iii) It always bounds a distance to the exhaustive exploration. After reporting experimentations showing the effectiveness of our method, we discuss its generalization to other kinds of patterns.
Fichier principal
Vignette du fichier
Anytime Subgroup Discovery in Numerical Datasets with Guarantees.pdf (537.77 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02117627 , version 1 (20-06-2019)



Aimene Belfodil, Adnene Belfodil, Mehdi Kaytoue. Anytime Subgroup Discovery in Numerical Domains with Guarantees. Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2018, Sep 2018, Dublin, Ireland. pp.500-516, ⟨10.1007/978-3-030-10928-8_30⟩. ⟨hal-02117627⟩
126 View
241 Download



Gmail Mastodon Facebook X LinkedIn More