FSSD - A Fast and Efficient Algorithm for Subgroup Set Discovery - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

FSSD - A Fast and Efficient Algorithm for Subgroup Set Discovery

Aimene Belfodil
Anes Bendimerad
Philippe Lamarre
Céline Robardet
Mehdi Kaytoue
Marc Plantevit


Subgroup discovery (SD) is the task of discovering interpretable patterns in the data that stand out w.r.t. some property of interest. Discovering patterns that accurately discriminate a class from the others is one of the most common SD tasks. Standard approaches of the literature are based on local pattern discovery, which is known to provide an overwhelmingly large number of redundant patterns. To solve this issue, pattern set mining has been proposed: instead of evaluating the quality of patterns separately, one should consider the quality of a pattern set as a whole. The goal is to provide a small pattern set that is diverse and well-discriminant to the target class. In this work, we introduce a novel formulation of the task of diverse subgroup set discovery where both discriminative power and diversity of the subgroup set are incorporated in the same quality measure. We propose an efficient and parameter-free algorithm dubbed FSSD and based on a greedy scheme. FSSD uses several optimization strategies that enable to efficiently provide a high quality pattern set in a short amount of time.
Fichier principal
Vignette du fichier
DSAA - Fast and Efficient Subgroup Set Mining with Guarantees.pdf (364.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02355503 , version 1 (08-11-2019)



Adnene Belfodil, Aimene Belfodil, Anes Bendimerad, Philippe Lamarre, Céline Robardet, et al.. FSSD - A Fast and Efficient Algorithm for Subgroup Set Discovery. IEEE International Conference on Data Science and Advanced Analytics (DSAA), Oct 2019, Washington DC, United States. ⟨10.1109/DSAA.2019.00023⟩. ⟨hal-02355503⟩
128 View
769 Download



Gmail Facebook X LinkedIn More