Characterization and extraction of condensed representation of correlated patterns based on formal concept analysis
This work addresses the need for efficient pattern mining in data analysis, but it appears incremental as it builds on existing methods for correlated patterns.
The paper tackles the problem of extracting a condensed representation of both frequent and rare correlated patterns in data mining by leveraging formal concept analysis and the bond correlation measure, resulting in a subset that retains all information without loss.
Correlated pattern mining has increasingly become an important task in data mining since these patterns allow conveying knowledge about meaningful and surprising relations among data. Frequent correlated patterns were thoroughly studied in the literature. In this thesis, we propose to benefit from both frequent correlated as well as rare correlated patterns according to the bond correlation measure. We propose to extract a subset without information loss of the sets of frequent correlated and of rare correlated patterns, this subset is called ``Condensed Representation``. In this regard, we are based on the notions derived from the Formal Concept Analysis FCA, specifically the equivalence classes associated to a closure operator fbond dedicated to the bond measure, to introduce new concise representations of both frequent correlated and rare correlated patterns.