A three-way confirmatory approach to formal concept analysis in classification

被引:2
|
作者
Hu, Mengjun [1 ,3 ]
Wang, Zhen [2 ,4 ]
机构
[1] St Marys Univ, Dept Math & Comp Sci, Halifax, NS B3H 3C3, Canada
[2] Beijing Jiaotong Univ, Weihai Inst, Weihai 264401, Shandong, Peoples R China
[3] Hunan Inst Sci & Technol, Dept Math, Yueyang 414015, Hunan, Peoples R China
[4] Northwest Univ, Inst Concepts Cognit & Intelligence, Xian 710127, Shaanxi, Peoples R China
关键词
Three-way Bayesian confirmation; Formal concept analysis; Three-way classification; Positive intent; Negative intent; ATTRIBUTE REDUCTION THEORY; CONCEPT LATTICES; ROUGH SETS; INCREMENTAL ALGORITHM; IMBALANCED DATA; DECISION; CONNECTIONS; HYPOTHESES;
D O I
10.1016/j.asoc.2024.111448
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Formal concept analysis (FCA) has demonstrated its effectiveness in classification through various studies. A few types of FCA-based classifiers, such as rule -based, concept -cognitive -learning -based, and hypothesisbased models, have been introduced for different purposes and distinct contexts. Nevertheless, these diverse models share fundamental principles that underlie the construction of effective FCA-based classifiers. This study contributes to the field in at least two aspects. Firstly, we present a general framework of FCA-based classification by reviewing, reformulating, and generalizing the existing models. The framework consists of four essential steps: intent learning, intent grouping, rule induction, and rule application. Secondly, following the presented framework, we integrate Bayesian confirmation theory and propose a novel three-way confirmatory approach to FCA-based classification. The proposed approach provides a fresh lens of formulating, analyzing, and interpreting results from FCA-based classifiers. Moreover, this approach can also be used to re -interpret existing hypothesis -based models, potentially leading to new insights and advancements in the field. The integration of Bayesian confirmation theory enriches the theoretical foundation of FCA-based classifiers, fostering the exploration of promising avenues for future research and development.
引用
收藏
页数:16
相关论文
共 50 条
  • [31] Three-way classification for sequences of observations
    Savchenko, A. V.
    Savchenko, L. V.
    INFORMATION SCIENCES, 2023, 648
  • [32] Three-Way Analysis of Spectrospatial Electromyography Data: Classification and Interpretation
    Kauppi, Jukka-Pekka
    Hahne, Janne
    Mueller, Klaus-Robert
    Hyvaerinen, Aapo
    PLOS ONE, 2015, 10 (06):
  • [33] A Three-Way Decision Making Approach to Malware Analysis
    Nauman, Mohammad
    Azam, Nouman
    Yao, JingTao
    ROUGH SETS AND KNOWLEDGE TECHNOLOGY, RSKT 2015, 2015, 9436 : 286 - 298
  • [34] The dynamic update method of attribute-induced three-way granular concept in formal contexts
    Long, Binghan
    Xu, Weihua
    Zhang, Xiaoyan
    Yang, Lei
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2020, 126 : 228 - 248
  • [35] On relationship between three-way concept lattices
    Zhao, Xuerong
    Miao, Duoqian
    Hu, Bao Qing
    INFORMATION SCIENCES, 2020, 538 : 396 - 414
  • [36] The attribute reductions of three-way concept lattices
    Ren, Ruisi
    Wei, Ling
    KNOWLEDGE-BASED SYSTEMS, 2016, 99 : 92 - 102
  • [37] The structure theorem of three-way concept lattice
    Zhai, Yanhui
    Qi, Jianjun
    Li, Deyu
    Zhang, Chao
    Xu, Weihua
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2022, 146 : 157 - 173
  • [38] Multiview granular data analytics based on three-way concept analysis
    Zhen Wang
    Jianjun Qi
    Chengjun Shi
    Ruisi Ren
    Ling Wei
    Applied Intelligence, 2023, 53 : 14645 - 14667
  • [39] Visualization and Analysis of Three-Way Data Using Accumulated Concept Graphs
    Ichino, Manabu
    Umbleja, Kadri
    Yaguchi, Hiroyuki
    APPLIEDMATH, 2024, 4 (03): : 1162 - 1180
  • [40] Neutrosophic three-way concept lattice and its application in conflict analysis
    Yang, Han
    Qin, Keyun
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 41 (02) : 3219 - 3236