Factorizing lattices by interval relations

被引:3
|
作者
Koyda, Maren [1 ]
Stumme, Gerd [1 ]
机构
[1] Univ Kassel, Res Ctr Informat Syst Design, Knowledge & Data Engn Grp, Wilhelmshoher Allee 73, D-34121 Kassel, Germany
关键词
Formal concept analysis; Lattices; Intervals; Factorization; Order; Crowns; CONGRUENCE RELATIONS; KNOWLEDGE;
D O I
10.1016/j.ijar.2023.03.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 the enrichment of an incidence relation by a set of intervals in a formal context, to investigate the approach for lattice-generating interval relations on the context side.(c) 2023 Published by Elsevier Inc.
引用
收藏
页码:70 / 87
页数:18
相关论文
共 50 条
  • [21] Three-way concept lattices triggered by Pythagorean fuzzy set and interval set
    Zhao, Jie
    Wan, Renxia
    Miao, Duoqian
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2025, 16 (01) : 285 - 299
  • [22] Measuring consistency of interval-valued preference relations: comments and comparison
    Liu, Fang
    Huang, Mao-Jie
    Huang, Cai-Xia
    Pedrycz, Witold
    OPERATIONAL RESEARCH, 2022, 22 (01) : 371 - 399
  • [23] Factorization of residuated lattices
    Krupka, Michal
    LOGIC JOURNAL OF THE IGPL, 2009, 17 (02) : 205 - 223
  • [24] Goal programming models for incomplete interval additive reciprocal preference relations with permutations
    Huang, Mao-Jie
    Liu, Fang
    Peng, Ya-Nan
    Yu, Qin
    GRANULAR COMPUTING, 2020, 5 (03) : 373 - 386
  • [25] On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices
    Konecny, Jan
    FUZZY SETS AND SYSTEMS, 2018, 351 : 108 - 121
  • [26] Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
    Belohlavek, Radim
    Outrata, Jan
    Trnecka, Martin
    INFORMATION SCIENCES, 2019, 489 : 37 - 49
  • [27] Computing iceberg concept lattices with TITANIC
    Stumme, G
    Taouil, R
    Bastide, Y
    Pasquier, N
    Lakhal, L
    DATA & KNOWLEDGE ENGINEERING, 2002, 42 (02) : 189 - 222
  • [28] Which concept lattices are pseudo complemented?
    Gantar, B
    Kwuida, L
    FORMAL CONCEPT ANALYSIS, PROCEEDINGS, 2005, 3403 : 408 - 416
  • [29] Robust Fault Diagnosis of Nonlinear Systems Using Interval Constraint Satisfaction and Analytical Redundancy Relations
    Tornil-Sin, Sebastian
    Ocampo-Martinez, Carlos
    Puig, Vicenc
    Escobet, Teresa
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2014, 44 (01): : 18 - 29
  • [30] A new AHP-prioritization method based on linear programming for crisp and interval preference relations
    Foroughi, Ali Asghar
    Azad, Hooshyar
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (06) : 3778 - 3797