Revisiting Numerical Pattern Mining with Formal Concept Analysis
Mehdi Kaytoue (INRIA Lorraine - LORIA), Sergei O. Kuznetsov, Amedeo, Napoli (INRIA Lorraine - LORIA)

TL;DR
This paper introduces a novel approach for mining numerical data using Formal Concept Analysis that preserves information and improves efficiency compared to traditional scaling methods.
Contribution
It proposes direct analysis of numerical data within FCA, revisiting key concepts and introducing two new algorithms that outperform existing methods.
Findings
The new algorithms are more efficient on real-world data.
Direct numerical analysis reduces information loss.
The approach outperforms traditional scaling methods.
Abstract
In this paper, we investigate the problem of mining numerical data in the framework of Formal Concept Analysis. The usual way is to use a scaling procedure --transforming numerical attributes into binary ones-- leading either to a loss of information or of efficiency, in particular w.r.t. the volume of extracted patterns. By contrast, we propose to directly work on numerical data in a more precise and efficient way, and we prove it. For that, the notions of closed patterns, generators and equivalent classes are revisited in the numerical context. Moreover, two original algorithms are proposed and used in an evaluation involving real-world data, showing the predominance of the present approach.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Data Mining Algorithms and Applications · Data Management and Algorithms
