Factorizing Lattices by Interval Relations
Maren Koyda, Gerd Stumme

TL;DR
This paper introduces a novel lattice factorization method that selectively implodes intervals using interval relations, extending existing approaches with a new FCA-based construction for generating lattices.
Contribution
It presents a new lattice factorization technique based on interval relations, enabling the implosion of disjoint intervals and extending FCA methods for lattice generation.
Findings
Introduces a new interval relation for lattice factorization.
Enables imploding disjoint intervals in finite lattices.
Provides a new FCA construction for lattice generation.
Abstract
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this purpose and answer the question of finding the finest of those relations to implode a given interval in the generated factor lattice. To overcome the limitations of the factorization based on those relations, we introduce a new lattice factorization that enables the imploding of selected disjoint intervals of a finite lattice. To this end, we propose an interval relation that generates this factorization. To obtain lattices rather than arbitrary ordered sets, we restrict this approach to so-called pure intervals. For our study, we will make use of methods from Formal Concept Analysis (FCA). We will also provide a new FCA construction by introducing…
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 · Multi-Criteria Decision Making · Data Mining Algorithms and Applications
