Summarizing Contrasts by Recursive Pattern Mining - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Summarizing Contrasts by Recursive Pattern Mining


A lot of constrained patterns (e.g., emerging patterns, subgroup discovery, classification rules) emphasize the contrasts between data classes and are at the core of many classification techniques. Nevertheless, the extremely large collection of generated patterns hampers the end-user interpretation and the deep understanding of the knowledge revealed by the whole collection of patterns. The key idea of this paper is to summarize the contrasts of a dataset in order to provide understandable characterizations of data classes. We first introduce a novel framework, called recursive pattern mining, for only discovering few as well as relevant patterns. We demonstrate that this approach encompasses usual pattern mining framework and we study its key properties. Then, we use recursive pattern mining for extracting k recursive emerging patterns. Taken together, these patterns form a REP k-summary which summarizes the contrasts of the dataset. Finally, we validate our approach on benchmarks and real-world applications on the biological domain, showing the efficiency and the usefulness of the approach.
Fichier principal
Vignette du fichier
Soulet2011.pdf (191.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01021980 , version 1 (11-07-2022)


Attribution - NonCommercial - CC BY 4.0



Arnaud Soulet, Bruno Crémilleux, Marc Plantevit. Summarizing Contrasts by Recursive Pattern Mining. IEEE 11th International Conference on Data Mining Workshops (ICDMW), Dec 2011, Vancouver, Canada. pp.1155-1162, ⟨10.1109/ICDMW.2011.161⟩. ⟨hal-01021980⟩
311 View
13 Download



Gmail Facebook Twitter LinkedIn More