Skip to Main content Skip to Navigation
New interface
Conference papers

A Relaxation-based Approach for Mining Diverse Closed Patterns

Abstract : In recent years, pattern mining has moved from a slow-moving repeated three-step process to a much more agile iterative/user-centric mining model. A vital ingredient of this framework is the ability to quickly present a set of diverse patterns to the user. In this paper, we use constraint programming (wellsuited to user-centric mining due to its rich constraint language) to efficiently mine a diverse set of closed patterns. Diversity is controlled through a threshold on the Jaccard similarity of pattern occurrences. We show that the Jaccard measure has no monotonicity property, which prevents usual pruning techniques and makes classical pattern mining unworkable. This is why we propose antimonotonic lower and upper bound relaxations, which allow effective pruning, with an efficient branching rule, boosting the whole search process. We show experimentally that our approach significantly reduces the number of patterns and is very efficient in terms of running times, particularly on dense data sets.
Document type :
Conference papers
Complete list of metadata
Contributor : Samir Loudni Connect in order to contact the contributor
Submitted on : Tuesday, June 1, 2021 - 12:45:59 AM
Last modification on : Thursday, November 17, 2022 - 4:48:10 PM
Long-term archiving on: : Thursday, September 2, 2021 - 6:07:09 PM


Files produced by the author(s)



Arnold Hien, Samir Loudni, Noureddine Aribi, Yahia Lebbah, Mohammed El Amine Laghzaoui, et al.. A Relaxation-based Approach for Mining Diverse Closed Patterns. Machine Learning and Knowledge Discovery in Databases - European Conference, {ECML} {PKDD} 2020, Sep 2020, Ghent (virtual), Belgium. pp.36--54, ⟨10.1007/978-3-030-67658-2_3⟩. ⟨hal-03244005⟩



Record views


Files downloads