Association rule mining with fuzzy linguistic information based on attribute partial ordered structure

被引:5
作者
Pang, Kuo [1 ]
Li, Shaoxiong [2 ]
Lu, Yifan [3 ]
Kang, Ning [4 ]
Zou, Li [5 ]
Lu, Mingyu [1 ]
机构
[1] Dalian Maritime Univ, Sch Informat Sci & Technol, Dalian 116026, Peoples R China
[2] Shanghai Univ Tradit Chinese Med, Sch Acupuncture Moxibust & Tuina, Shanghai 201203, Peoples R China
[3] Dalian Univ Technol, Sch Comp Sci & Technol, Dalian 116081, Peoples R China
[4] East China Normal Univ, Software Engn Inst, Shanghai 200062, Peoples R China
[5] Shandong Jianzhu Univ, Sch Comp Sci & Technol, Jinan 250101, Peoples R China
基金
中国国家自然科学基金;
关键词
Formal concept analysis; Concept lattice; Attribute partial ordered structure; Linguistic truth-valued lattice implication algebra; Association rule; FREQUENT; LATTICE; ALGORITHM; MODEL; SETS;
D O I
10.1007/s00500-023-09145-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In many application domains, there is an urgent need for data owners to mine attribute associations hidden in linguistic conceptual knowledge. Numerous linguistically valued facts from the actual world have been modeled using the fuzzy linguistic approach. To solve the problem of association rule mining with fuzzy linguistic information, this paper proposes an association rule mining approach based on fuzzy linguistic attribute partial ordered structure diagram (FL-APOSD). First, complex relationships between linguistic values in association rule mining are represented by fuzzy linguistic association nodes and association paths via FL-APOSD. On this basis, the maximum frequent attribute set is mined from the FL-APOSD, and then the non-redundancy association rules are extracted. Second, to show the information hidden in the rules and help users to deeply understand the mining results, a fuzzy linguistic association rule visualization approach is proposed to convert the association rules into the FL-APOSD-based knowledge representation. Finally, experimental results on real-world datasets show the proposed approach's high efficiency, outperforming two relevant state-of-the-art approaches.
引用
收藏
页码:17447 / 17472
页数:26
相关论文
共 46 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]  
[Anonymous], 2013, ICIC Express Lett Part B Appl Int J Res Surv
[3]   NECLATCLOSED: A vertical algorithm for mining frequent closed itemsets [J].
Aryabarzan, Nader ;
Minaei-Bidgoli, Behrouz .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 174
[4]   negFIN: An efficient algorithm for fast mining frequent itemsets [J].
Aryabarzan, Nader ;
Minaei-Bidgoli, Behrouz ;
Teshnehlab, Mohammad .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 105 :129-143
[5]   Extracting Concepts From Fuzzy Relational Context Families [J].
Boffa, Stefania .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2023, 31 (04) :1202-1213
[6]   A proposal to extend Relational Concept Analysis with fuzzy scaling quantifiers [J].
Boffa, Stefania ;
Murinova, Petra ;
Novak, Vilem .
KNOWLEDGE-BASED SYSTEMS, 2021, 231
[7]  
Demsar J, 2006, J MACH LEARN RES, V7, P1
[8]   DiffNodesets: An efficient structure for fast mining frequent itemsets [J].
Deng, Zhi-Hong .
APPLIED SOFT COMPUTING, 2016, 41 :214-223
[9]  
Deng ZH, 2010, INT J COMPUT INT SYS, V3, P733
[10]  
Dexing Wang, 2012, Artificial Intelligence and Computational Intelligence. Proceedings of the 4th International Conference, AICI 2012, P142, DOI 10.1007/978-3-642-33478-8_19