An Order-Theoretic Study on Formal Concept Analysis

被引:1
|
作者
Syau, Yu-Ru [1 ]
Lin, En-Bing [2 ]
Liau, Churn-Jung [3 ]
机构
[1] Natl Formosa Univ, Dept Informat Management, Yunlin 63201, Taiwan
[2] Wentworth Inst Technol, Sch Comp & Data Sci, Boston, MA 02115 USA
[3] Acad Sinica, Inst Biomed Sci, Taipei 11529, Taiwan
关键词
formal concept analysis; object concepts; attribute concepts; join-irreducibility; meet-irreducibility; rough conceptual approximations;
D O I
10.3390/axioms12121099
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper employs an order-theoretic framework to explore the intricacies of formal concepts. Initially, we establish a natural correspondence among formal contexts, preorders, and the resulting partially ordered sets (posets). Leveraging this foundation, we provide insightful characterizations of atoms and coatoms within finite concept lattices, drawing upon object intents. Expanding from the induced poset originating from a formal context, we extend these characterizations to discern join-irreducible and meet-irreducible elements within finite concept lattices. Contrary to a longstanding misunderstanding, our analysis reveals that not all object and attribute concepts are irreducible. This revelation challenges the conventional belief that rough approximations, grounded in irreducible concepts, offer sufficient coverage. Motivated by this realization, the paper introduces a novel concept: rough conceptual approximations. Unlike the conventional definition of object equivalence classes in Pawlakian approximation spaces, we redefine them by tapping into the extent of an object concept. Demonstrating their equivalence, we establish that rough conceptual approximations align seamlessly with approximation operators in the generalized approximation space associated with the preorder corresponding to a formal context. To illustrate the practical implications of these theoretical findings, we present concrete examples. Furthermore, we delve into the significance and potential applications of our proposed rough conceptual approximations, shedding light on their utility in real-world scenarios.
引用
收藏
页数:20
相关论文
共 50 条
  • [1] Testing the order-theoretic similariy model and making perceived similarity explicit with Formal Concept Analysis
    Endres, D.
    Giese, M. A.
    PERCEPTION, 2013, 42 : 130 - 130
  • [2] An Order-Theoretic Analysis of Universe Polymorphism
    Hou , Kuen-Bang
    Angiuli, Carlo
    Mullanix, Reed
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (POPL): : 1659 - 1685
  • [3] On the order-theoretic properties of lower concept formula systems
    Guo, Lankun
    Li, Qingguo
    Jia, Xiaodong
    SOFT COMPUTING, 2014, 18 (02) : 207 - 216
  • [4] On the order-theoretic properties of lower concept formula systems
    Lankun Guo
    Qingguo Li
    Xiaodong Jia
    Soft Computing, 2014, 18 : 207 - 216
  • [5] ORDER-THEORETIC FUNCTIONS
    SCHEID, H
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1969, 238 : 1 - &
  • [6] On the order-theoretic Cantor theorem
    Granas, A
    Horvath, CD
    TAIWANESE JOURNAL OF MATHEMATICS, 2000, 4 (02): : 203 - 213
  • [7] An Order-Theoretic Quantification of Contextuality
    Durham, Ian T.
    INFORMATION, 2014, 5 (03) : 508 - 525
  • [8] Induced betweenness in order-theoretic trees
    Courcelle B.
    Discrete Mathematics and Theoretical Computer Science, 2022, 23 (02):
  • [9] AN ORDER-THEORETIC APPROACH TO INVOLUTIVE ALGEBRAS
    RENDER, H
    STUDIA MATHEMATICA, 1989, 92 (02) : 177 - 186