Next Article in Journal
Factorization of Hausdorff Operators
Previous Article in Journal
Power Truncated Positive Normal Distribution: A Quantile Regression Approach Applied to Health Databases
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice and Its Application to Linguistic Association Rule Extraction

1
School of Information Science and Engineering, Yanshan University, Qinhuangdao 066000, China
2
Information Science and Technology College, Dalian Maritime University, Dalian 116026, China
3
School of Mathematics, Southwest Jiaotong University, Chengdu 611756, China
4
School of Computer Science and Technology, Shandong Jianzhu University, Jinan 250102, China
5
National Engineering Research Center of Geographic Information System, China University of Geosciences, Wuhan 430078, China
*
Authors to whom correspondence should be addressed.
Axioms 2024, 13(12), 812; https://doi.org/10.3390/axioms13120812
Submission received: 19 September 2024 / Revised: 18 November 2024 / Accepted: 20 November 2024 / Published: 21 November 2024

Abstract

:
In a world rich with linguistic-valued data, traditional methods often lead to significant information loss when converting such data into other formats. This paper presents a novel approach for constructing an interval linguistic-valued intuitionistic fuzzy concept lattice, which adeptly manages qualitative linguistic information by leveraging the strengths of interval-valued intuitionistic fuzzy sets to represent both fuzziness and uncertainty. First, the interval linguistic-valued intuitionistic fuzzy concept lattice is constructed by integrating interval intuitionistic fuzzy sets, capturing the bidirectional fuzzy linguistic information between objects, which encompasses both positive and negative aspects. Second, by analyzing the expectations of concept extent relative to intent, and considering both the membership and non-membership perspectives of linguistic expressions, we focus on the extraction of linguistic association rules. Finally, comparative analyses and examples demonstrate the effectiveness of the proposed approach, showcasing its potential to advance the management of linguistic data in various domains.

1. Introduction

Formal concept analysis (FCA), introduced by Wille in 1982 [1], is a mathematical framework designed to systematically analyze relationships between objects and attributes in a formal context. FCA typically operates on binary data tables, which consist of an object set, an attribute set, and binary relations between them. FCA outputs include structures such as concept lattices [2], attribute implications [3], attribute topology [4], and partial order structures [5,6], allowing it to be adapted to various downstream tasks based on specific analytical requirements.
Due to the increasing diversity and complexity of data, individuals often encounter substantial uncertainty in knowledge discovery. To better express this uncertainty and the inherent fuzziness of data, Zadeh [7] proposed the concept of the fuzzy set (FS) in 1965. Fuzzy sets have since found widespread application in various fields, including economic management, science and technology, multiple objective optimization, and medical diagnosis [8,9,10,11,12]. However, one of the limitations of traditional fuzzy sets is their inability to effectively describe the degree of negation or uncertainty in the evaluation information provided by decision-makers. To address this limitation, Atanassov [13] extended the concept of fuzzy sets by proposing intuitionistic fuzzy sets (IFSs), which introduced a non-membership function in addition to the traditional membership function. This advancement allowed IFSs to simultaneously account for both positive and negative evaluations from decision-makers while implicitly considering their hesitation. The introduction of IFSs significantly enhanced the ability to handle uncertainty in decision-making processes, leading to widespread recognition and adoption across the field. Numerous scholars have since explored the theoretical foundations and practical applications of IFSs [14,15,16].
While IFSs have been effective across a range of domains, their limitation lies in the reliance on real-number evaluations for membership and non-membership degrees. Given the complexity of decision-making processes and the inherent ambiguity in human reasoning, it is often impractical to express evaluations solely as precise numerical values. In response, Atanassov [17] introduced interval-valued intuitionistic fuzzy sets (IVIFSs), where both membership and non-membership degrees are represented by intervals. This development provided a more flexible and expressive framework for capturing the inherent uncertainty and variability of real-world scenarios.
In real-world scenarios, people often express qualitative information using linguistic values. To model such linguistic expressions, many scholars have employed fuzzy linguistic approaches [18,19]. Recognizing the natural language characteristics of linguistic expressions, Xu et al. [20] introduced the concepts of linguistic truth-valued lattice implication algebra and linguistic truth-valued propositional logic. Additionally, Liao et al. [21] proposed the hesitant fuzzy linguistic term set and developed methods to measure the distance and similarity between different hesitant fuzzy linguistic term sets, providing further tools for linguistic data analysis.
In classical FCA, the relationships between objects and attributes are typically represented in binary form (i.e., 0 or 1), reflecting a crisp setting. However, many attributes in real life exhibit fuzziness, which binary representations fail to capture. To address this limitation, linguistic expressions can be used to qualitatively describe such attributes. For example, in medical consultations, a patient’s condition might be described using terms such as “serious”, “not serious”, or “very serious”. The challenge of embedding expressions into FCA has thus emerged as a key research topic [22,23]. Building on the foundation of linguistic truth-valued lattice implication algebra and linguistic term sets, Zou et al. [24,25,26] extended the concept lattice to include linguistic concept lattices, linguistic truth-valued intuitionistic fuzzy lattices, and intuitionistic fuzzy linguistic concept lattices. By incorporating linguistic expressions into FCA, these approaches offer more nuanced and accurate representations of complex, real-world scenarios, making them valuable tools for decision-making processes in uncertain and qualitative environments.
Concept lattices, formed by extracting concepts from a formal context via derivation operators, provide a hierarchical structure that captures generalization and specialization relationships among attributes. This hierarchy has made concept lattices a valuable tool for extracting association rules [27,28]. Zou et al. [27,29] developed algorithms to extract association rules based on concept lattices and fuzzy concept lattices, with applications spanning recommendation systems and incremental concept lattice construction. Zhi et al. [30] proposed a method for updating concept lattices in dynamic environments, using minimal generators to optimize computational efficiency in rule extraction. However, these approaches often rely on converting fuzzy information to numeric intervals, which may limit their applicability to qualitative contexts.
To address the aforementioned challenges, this paper presents a novel approach to constructing interval linguistic-valued intuitionistic fuzzy concept lattices and extracting linguistic association rules. While IVIFSs have been effective for quantitative evaluation, their limitations in capturing qualitative evaluation information have necessitated a more flexible framework. The primary contributions of this paper can be summarized as follows:
  • Development of interval linguistic-valued intuitionistic fuzzy concept lattices: We introduce a novel framework that extends classical concept lattices by incorporating interval linguistic-valued intuitionistic fuzzy sets. This advancement enables the handling of both quantitative and qualitative uncertainty.
  • Enhanced representation of linguistic terms for qualitative analysis: Our approach integrates linguistic terms directly into the lattice structure, allowing for a more accurate representation of the fuzziness and ambiguity inherent in linguistic evaluations. This improvement preserves the original richness of linguistic information without transforming it into numerical values, which often leads to loss of context and precision.
  • Efficient extraction of linguistic association rules: We propose a dedicated algorithm to extract association rules from interval linguistic-valued intuitionistic fuzzy concept lattices. This algorithm effectively captures relationships in linguistic data, providing valuable insights for applications where qualitative data interpretation is essential.
The rest of this paper is organized as follows. In Section 2, we propose the interval linguistic-valued intuitionistic fuzzy concept lattice based on the concept lattice and linguistic term set. In Section 3, we generate a linguistic association rule set based on the interval linguistic-valued intuitionistic fuzzy concept lattice; on this basis, we give the corresponding association rule extraction algorithm. Section 4 illustrates the effectiveness of the proposed approach through a bank financial risk assessment example. Section 5 compares our proposed approach with existing association rule extraction approaches. Finally, we conclude the paper with a summary and outlook for further research in Section 6. In the Appendix A, we present some preliminaries.

2. Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice

In practical applications in different fields such as evaluation, decision making, and control, different people often have different evaluation values (observed values) of the same object or target from different angles. Many scholars have carried out extended research on intuitionistic fuzzy sets, and introduced the concept of interval-valued intuitionistic fuzzy sets, which can well describe the fuzziness and uncertainty of the “neutral state”. In this section, we propose the interval linguistic-valued intuitionistic fuzzy formal context based on interval-valued intuitionistic fuzzy sets and linguistic term sets. According to the duality principle of concept lattices, we construct the interval linguistic-valued intuitionistic fuzzy concept lattice.

2.1. The Construction of the Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice

In this subsection, interval linguistic-valued intuitionistic fuzzy formal contexts and the corresponding concept lattices are introduced.
Definition 1.
Let X be the universe of discourse, then an interval linguistic-valued intuitionistic fuzzy set I on X is defined as follows:
I = { x , s μ ( x ) , s ν ( x ) x X } ,
where s μ ( x ) = [ s μ x , s μ + x ] and s ν ( x ) = [ s ν x , s ν + x ] are, respectively, expressed as the interval linguistic-valued membership degree and the interval linguistic-valued non-membership degree of I. For all x X on I, s 0 s μ + x + s ν + x s g . We say S π x = [ s g s μ + x s ν + x , s g s μ x s ν x ] is the interval linguistic-valued intuitionistic fuzzy hesitation degree of I. We denote all interval linguistic-valued intuitionistic fuzzy sets on I as ILV-IFS ( I ) .
The operation between any two interval-valued intuitionistic fuzzy sets X 1 , X 2 ILV - IFS ( I ) is defined as follows:
1. 
X 1 C = { x , [ s ν 1 x , s ν 1 + x ] , [ s μ 1 x , s μ 1 + x ] | x X } is the complement of X 1 ;
2. 
X 1 X 2 = [ s μ 1 x s μ 2 x , s μ 1 + x s μ 2 + x ] , [ s ν 1 x s ν 2 x , s ν 1 + x s ν 2 + x ) ] ;
3. 
X 1 X 2 = [ s μ 1 x s μ 2 x , s μ 1 + x s μ 2 + x ] , [ s ν 1 x , a s ν 2 x ) , s ν 1 + x s ν 2 + x ) ] ;
4. 
X 1 X 2 s μ 1 x s μ 2 x , s μ 1 + x s μ 2 + x , s ν 1 x s ν 2 x , s ν 1 + x s ν 2 + x .
Definition 2.
An interval linguistic-valued intuitionistic fuzzy formal context is a triple U , A , S * , where U = x 1 , x 2 , , x m is a set of objects, A = a 1 , a 2 , , a n is a set of attributes, S is a linguistic term set, and S * : U × A I n t ( S × S ) × I n t ( S × S ) is an interval linguistic-valued intuitionistic fuzzy relationship between U and A such that
S * = { x , [ s μ x , a , s μ + x , a ] , [ s ν x , a , s ν + x , a ] x , a U × A } .
Here, I n t ( S × S ) represents the interval linguistic-valued membership degree. Specifically, [ s μ x , a , s μ + x , a ] represents the interval linguistic-valued membership degree between x and a, s μ + x , a and s μ x , a represent the upper and lower bounds of the interval linguistic-valued membership degree, respectively. [ s ν x , a , s ν + x , a ] represents the interval linguistic-valued non-membership degree between x and a, s ν + x , a and s ν x , a represent the upper and lower bounds of the interval linguistic-valued non-membership degree, respectively. We denote by S U the set of all interval linguistic-valued intuitionistic fuzzy sets on U.
Linguistic terms within an interval-valued intuitionistic fuzzy framework inherently carry fuzziness and uncertainty, accommodating the ambiguities present in human language. For instance, “high” might be interpreted differently depending on the context, and the interval values enable a range-based approach that expresses this uncertainty.
The incorporation of linguistic terms enhances the interpretability of the concept lattice. Each concept within the concept lattice can be associated with specific linguistic terms, making it easier to interpret the relationships among concepts and understand the data patterns they represent.
Definition 3.
Let U , A , S * be an interval linguistic-valued intuitionistic fuzzy formal context. For any X ¨ S U , B A , two operators “” and “” can be defined as follows:
( ) : S U 2 A ,
X ¨ = { a A | X ¨ x S * x , a , x U } ,
( ) : 2 A S U ,
B = { [ s μ x , a , s μ + x , a ] , [ s μ x , a , s μ + x , a ] | a A } .
Proposition 1.
Suppose U , A , S * is an interval linguistic-valued intuitionistic fuzzy formal context, for any X ¨ , X ¨ 1 , X ¨ 2 S U and B , B 1 , B 2 A , then
1. 
X ¨ 1 X ¨ 2 X ¨ 2 X ¨ 1 , B 1 B 2 B 2 B 1 ;
2. 
X ¨ X ¨ , B B ;
3. 
( X ¨ 1 X ¨ 2 ) = X ¨ 1 X ¨ 2 , ( B 1 B 2 ) = B 1 B 2 ;
4. 
( X ¨ 1 X ¨ 2 ) X ¨ 1 X ¨ 2 , ( B 1 B 2 ) B 1 B 2 ;
5. 
X ¨ = X ¨ , B = B ;
6. 
X ¨ B B X ¨ .
Proof. 
According to Definition 3, we can easily prove that properties 1 and 2 hold.
3. According to Definition 3, we have ( X ¨ 1 X ¨ 2 ) = x X ¨ 1 X ¨ 2 x = ( x X ¨ 1 x ) ( x X ¨ 2 x ) = X ¨ 1 X ¨ 2 . Thus, ( X ¨ 1 X ¨ 2 ) = X ¨ 1 X ¨ 2 holds. Similarly, we can prove that ( B 1 B 2 ) = B 1 B 2 .
4. The proof is similar to property 3.
5. According to properties 1 and 2, we have X ¨ X ¨ . Suppose X ¨ = X ¨ , we have X ¨ X ¨ , i.e., X ¨ = X ¨ . Similarly, we have B = B . Therefore, property 3 is proved.
6. “⇒”: Suppose X ¨ B , according to Definition 3 we obtain B X ¨ . According to property 2, we have B B , which yields B X ¨ . Therefore, X ¨ B B X ¨ .
“⇐”: Suppose B X ¨ , according to Definition 3 we obtain X ¨ B . According to property 2, we have X ¨ X ¨ , which yields X ¨ B . Therefore, X ¨ B B X ¨ .
Combining the above arguments, we obtain X ¨ B B X ¨ .    □
Definition 4.
Let U , A , S * be an interval linguistic-valued intuitionistic fuzzy formal context. For any X ¨ S U , B A , if X ¨ = B and X ¨ = B , then a pair ( X ¨ , B ) is called an interval linguistic-valued intuitionistic fuzzy concept, and X ¨ and B are called the extent and intent of the interval linguistic-valued intuitionistic fuzzy concept, respectively.
Definition 5.
Let U , A , S * be an interval linguistic-valued intuitionistic fuzzy formal context, and M ¯ I F L L U , A , S * be the set of all interval linguistic-valued intuitionistic fuzzy concepts on U , A , S * . For any ( X ¨ 1 , B 1 ) , ( X ¨ 2 , B 2 ) M ¯ I F L L U , A , S * , the partial-order relationship “≤” between ( X ¨ 1 , B 1 ) and ( X ¨ 2 , B 2 ) is defined as
( X ¨ 1 , B 1 ) ( X ¨ 2 , B 2 ) X ¨ 1 X ¨ 2 ( B 1 B 2 ) ,
where ( X ¨ 1 , B 1 ) is called the subconcept of ( X ¨ 2 , B 2 ) , and ( X ¨ 2 , B 2 ) is called the superconcept of ( X ¨ 1 , B 1 ) . If there is no ( X ¨ 3 , B 3 ) that satisfies ( X ¨ 1 , B 1 ) ( X ¨ 3 , B 3 ) ( X ¨ 2 , B 2 ) , then ( X ¨ 1 , B 1 ) is a child concept of ( X ¨ 2 , B 2 ) , and ( X ¨ 2 , B 2 ) is the parent concept of ( X ¨ 1 , B 1 ) , which is recorded as ( X ¨ 1 , B 1 ) ( X ¨ 2 , B 2 ) .
Theorem 1.
Let U , A , S * be an interval linguistic-valued intuitionistic fuzzy formal context, and M ¯ I F L L U , A , S * be the set of all interval linguistic-valued intuitionistic fuzzy concepts on U , A , S * . For any ( X ¨ 1 , B 1 ) , ( X ¨ 2 , B 2 ) M ¯ I F L L U , A , S * , then
( X ¨ 1 , B 1 ) ( X ¨ 2 , B 2 ) = ( X ¨ 1 X ¨ 2 , ( B 1 B 2 ) ) ,
( X ¨ 1 , B 1 ) ( X ¨ 2 , B 2 ) = ( ( X ¨ 1 X ¨ 2 ) , B 1 B 2 ) ,
are also interval linguistic-valued intuitionistic fuzzy concepts.
Proof. 
According to 3, 4, and 5 of Proposition 1, we have ( B 1 B 2 ) = ( B 1 B 2 ) = B 1 B 2 = X ¨ 1 X ¨ 2 and ( X ¨ 1 X ¨ 2 ) = ( B 1 B 2 ) . According to Definition 3, we can prove that ( X ¨ 1 X ¨ 2 , ( B 1 B 2 ) ) M ¯ I F L L U , A , S * . Similarly, ( ( X ¨ 1 X ¨ 2 ) , B 1 B 2 ) M ¯ I F L L U , A , S * .    □
( M ¯ I F L L U , A , S * , ) is a complete lattice, called an interval linguistic-valued intuitionistic fuzzy concept lattice, denoted as M ¯ I F L L U , A , S * .
Theorem 2.
Let U , A , S * be an interval linguistic-valued intuitionistic fuzzy formal context, and M ¯ I F L L U , A , S * be the set of all interval linguistic-valued intuitionistic fuzzy concepts on U , A , S * . For any ( X ¨ 1 , B 1 ) , ( X ¨ 2 , B 2 ) M ¯ I F L L U , A , S * , then ( X ¨ 1 , X ¨ 1 ) , ( B 1 , B 1 ) M ¯ I F L L U , A , S * .
Proof. 
According to Proposition 1 and Definition 3, we can easily obtain ( X ¨ 1 , X ¨ 1 ) , ( B 1 , B 1 ) M ¯ I F L L U , A , S * .    □
The interval linguistic-valued intuitionistic fuzzy concept lattice offers several significant advantages over the classical concept lattice, especially in scenarios where data are uncertain, imprecise, or qualitative in nature. Here are some key benefits:
  • The interval linguistic-valued intuitionistic fuzzy concept lattice incorporates both fuzziness and intuitionistic uncertainty through interval values. This allows it to represent the degree of membership, non-membership, and hesitation more effectively than classical concept lattices, which are limited to binary or crisp relationships.
  • Unlike classical concept lattices, which rely on binary or numeric values, the interval linguistic-valued intuitionistic fuzzy concept lattice can directly handle linguistic terms (e.g., “high”, “medium”, “low”). This reduces the need for complex transformations and preserves the richness of linguistic information, reducing information loss.
  • This lattice structure captures both positive and negative relationships, allowing for a more nuanced representation of concepts and their connections. It can express both supportive and contrary relationships between objects and attributes, providing a fuller understanding of the data.
  • With its ability to incorporate both uncertainty and linguistic information, the interval linguistic-valued intuitionistic fuzzy concept lattice supports more informed and context-sensitive decision making. It provides a more accurate basis for rule extraction and association mining, yielding insights that would be difficult to capture using a classical concept lattice.

2.2. Algorithm Description

From Definitions 3 and 4, all the interval linguistic-valued intuitionistic fuzzy concepts are obtained. According to Definition 5, we can obtain the partial order of all interval linguistic-valued intuitionistic fuzzy concepts to construct the interval linguistic-valued intuitionistic fuzzy concept lattice. This subsection provides a description of the algorithm for generating the interval linguistic-valued intuitionistic fuzzy concept lattice.
Through the analysis in the previous section, we give the Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice Generation (IVI-FCLG) algorithm (see Algorithm 1).
In the following, we analyze the time complexity of the IVI-FCLG algorithm.
In Algorithm 1, we assume that the interval linguistic-valued intuitionistic fuzzy formal context U , A , S * has o attributes and p objects. According to steps 1–2, the objects and attributes needs to be traversed when computing X ¨ and B. According to steps 3–14, when computing the parent–child concepts, it is necessary to determine X ¨ i X ¨ j or X ¨ j X ¨ i . Therefore, the overall time complexity of the IVI-FCLG is O ( p o 2 ) .
Algorithm 1: IVI-FCLG
Input: Interval linguistic-valued intuitionistic fuzzy formal context U , A , S *
Output: Interval linguistic-valued intuitionistic fuzzy concept lattice M ¯ I F L L U , A , S *
Axioms 13 00812 i001
IVI-FCLG serves as a preprocessing step for linguistic association rule extraction. It prepares the foundational structure (i.e., the interval linguistic-valued intuitionistic fuzzy concept lattice) that is essential for linguistic association rule extraction.

3. Linguistic Association Rule Extraction Based on Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice

The Hasse diagram can display the partial order in the concept lattice concisely, which is conducive to the rapid mining of effective association rules. In order to reduce the loss of information generated by the concept lattice when generating association rules, this section extracts linguistic association rules from the two perspectives of membership and non-membership of linguistic expressions through the interval linguistic-valued intuitionistic fuzzy set.
Definition 6.
Let U , A , S * be an interval linguistic-valued intuitionistic fuzzy formal context, and M ¯ I F L L U , A , S * be the interval linguistic-valued intuitionistic fuzzy concept lattice corresponding to U , A , S * . For any ( X ¨ , B ) M ¯ I F L L U , A , S * , the expectation E ( B ) of concept extent to intent is defined as
E B = 1 2 X ¨ j X ¨ 1 2 s μ x j , a + s μ + x j , a + s g 1 2 s ν x j , a + s ν + x j , a
The expectation value of a concept can be thought of as a measure of its linguistic membership strength within the dataset, which reflects how frequently a particular combination of attributes appears or holds significant meaning across the dataset.
In real-world datasets, some concepts might have very low membership values, indicating they are either rare or hold minimal significance in the context of the application. By setting a threshold θ for E B , we can effectively filter out these less relevant nodes, ensuring that only nodes with substantial relevance (i.e., those meeting or exceeding θ ) are considered in the rule generation process.
When E B is greater than a certain linguistic membership threshold θ , the node is called a frequent node. This helps filter out concepts that appear infrequently or lack strong linguistic association, thereby focusing the rule extraction process on nodes that represent commonly observed patterns.
Proposition 2.
Suppose U , A , S * is an interval linguistic-valued intuitionistic fuzzy formal context, and M ¯ I F L L U , A , S * is the interval linguistic-valued intuitionistic fuzzy concept lattice corresponding to U , A , S * . For any ( X ¨ , B ) M ¯ I F L L U , A , S * , the expectation E ( B ) satisfies
0 < E ( B ) 1 .
Proof. 
It follows immediately from Definition 6.    □
In the interval linguistic-valued intuitionistic fuzzy concept lattice, for a pair of frequent parent–child nodes ( C i , C j ) ( C i = ( X ¨ 1 , B 1 ) , C j = ( X ¨ 2 , B 2 ) ) , we call B 1 B 2 B 1 a linguistic association rule.
Definition 7.
Let R : B 1 B 2 B 1 be a linguistic association rule, then the confidence and support of R are defined as
C o n f R = min E B 1 , E B 2 max E B 1 , E B 2 ,
S u p R = E B 1 = 1 2 X ¨ 1 j X ¨ 1 ( 1 2 s μ x j , a + s μ + x j , a + s g 1 2 s ν x j , a + s ν + x j , a ) .
S u p ( R ) reflects the frequency of simultaneous occurrence of B 1 and B 2 B 1 in the attribute set. C o n f ( R ) reflects the probability of B 2 B 1 occurring when B 1 occurs.
Remark 1.
 1. The support S u p ( R ) represents the frequency at which both the antecedent B 1 and the consequent B 2 B 1 of the association rule occur together among all attributes. A higher support value indicates a stronger connection between B 1 and B 2 B 1 , suggesting a more frequent co-occurrence of these elements.
2. 
The confidence C o n f ( R ) reflects the probability that the consequent B 2 B 1 of the association rule appears when the antecedent B 1 is present. A higher confidence value indicates a more reliable association between the antecedent and the consequent in the linguistic association rule extraction.
Through the above discussion, we give a Linguistic Association Rule Extraction (LARE) algorithm based on an interval linguistic-valued intuitionistic fuzzy concept lattice (see Algorithm 2).
Algorithm 2: LARE
Axioms 13 00812 i002
In the following, we analyze the time complexity of LARE. Since the input to Algorithm 2 is an interval linguistic-valued intuitionistic fuzzy concept lattice, we do not consider the time complexity of constructing the interval linguistic-valued intuitionistic fuzzy concept lattice.
In Algorithm 2, we assume that the interval linguistic-valued intuitionistic fuzzy concept lattice M ¯ I F L L U , A , S * has q concepts. According to steps 1–9, the time complexity of computing the expectation E ( B i ) for each concept is O ( q ) . According to steps 11–19, assume that r ( r < q ) frequent nodes are generated from steps 1–9, and the time complexity of computing the confidence of two frequent nodes is O ( r 2 ) . Therefore, the overall time complexity of the LARE is O ( q + r 2 ) .
Several bottlenecks in the current design could impact the performance of the LARE algorithm, especially with larger datasets:
  • Exponential growth in subset calculation: Generating subsets for attributes ( 2 | A | ) poses a major challenge when | A | is large, as the number of subsets increases exponentially. This step is especially challenging in applications with a high-dimensional attribute space, as it quickly becomes computationally prohibitive.
  • High complexity of pairwise node comparison: Comparing each concept to others in terms of confidence relationships within the concept lattice ( | q | 2 ) can lead to significant computational overhead, particularly in dense lattices with many hierarchical connections.
  • Hierarchical relationships and Hasse diagram construction: Building and traversing the Hasse diagram for lattice relationships, particularly for rule extraction in complex lattices, may also introduce processing delays, especially when the lattice structure is highly interconnected.
LARE is a subsequent step that works exclusively on the output of IVI-FCLG. It uses the lattice structure as input to mine linguistic association rules.
The Hasse diagram serves as a crucial visualization tool for illustrating the partial order of concepts in an interval linguistic-valued intuitionistic fuzzy concept lattice. This structured visualization is particularly beneficial for rule extraction in the following ways:
  • The hierarchical nature of the Hasse diagram supports parent–child relationships, which are key to mining association rules. In LARE, for instance, rules are generated by examining these relationships to identify how attributes transition from one concept to another along the hierarchy. This approach allows for the systematic extraction of rules that reflect natural, progressive relationships, such as how adding an attribute might lead to a more specific concept.
  • By navigating the Hasse diagram, users can efficiently calculate metrics such as membership values and confidence for rules. Since each connection in the diagram represents a specific conceptual linkage, it becomes easier to apply thresholds (e.g., confidence and support) to filter and select only those rules that meet desired criteria. This filtering process ensures that the extracted rules are both relevant and interpretable.
  • The Hasse diagram’s visual structure helps users intuitively understand the logic behind each rule. By observing the transitions between concepts, users can interpret rules in terms of natural language expressions. For instance, if a concept associated with “high risk” in financial assessments is connected to another concept with “very high risk”, the rule extracted along this path can be directly interpreted as “if high risk, then very high risk”.

4. Case Study

In this section, we utilize our proposed IVI-FCLG and LARE approaches to address the problem of bank financial risk assessment in a linguistic environment. This paper focuses on the construction of an interval linguistic-valued intuitionistic fuzzy concept lattice and linguistic association rule extraction.

4.1. Background Description

In the banking sector, financial risk assessment is a critical process used to evaluate a customer’s likelihood of default, financial stability, and overall creditworthiness. Traditional risk assessment relies on quantitative metrics, such as credit scores, debt-to-income ratios, and historical loan repayment data. However, a purely numerical approach may overlook nuanced insights, particularly when data are uncertain or subjective. In such cases, linguistic assessments provide an alternative that captures qualitative aspects of financial risk using descriptors such as “high risk”, “moderate stability”, or “low reliability”. Linguistic association rule extraction is used to identify associations in this qualitative data to support decision making for loans, credit lines, and investments.

4.2. Problem Solution

We consider an interval linguistic-valued intuitionistic fuzzy formal context U , A , S * , as shown in Table 1, where U = x 1 , x 2 , x 3 , x 4 , x 5 represents five experts, A = a , b , c , d represents the set of qualitative risk assessment indices, and S = { s 1 , s 2 , s 3 , s 4 , s 5 , s 6 , s 7 , s 8 } represents the experts’ linguistic assessment values for bank financial risk.
According to Algorithm 1, we can obtain all interval linguistic-valued intuitionistic fuzzy concepts on the interval linguistic-valued intuitionistic fuzzy formal context U , A , S * , as shown in Table 2.
In Algorithm 1, through steps 3–14, we can determine the partial order between interval linguistic-valued intuitionistic fuzzy concepts and obtain the interval linguistic-valued intuitionistic fuzzy concept lattice M ¯ I F L L U , A , S * , as shown in Figure 1.
According to Algorithm 1, we set the average linguistic membership threshold θ = s 4.5 , the confidence threshold ϕ = 0.83 , and the linguistic association rule set R s extracted from Figure 1 is shown in Table 3.
Through the above analysis, we find that LARE describes the interval linguistic-valued intuitionistic fuzzy relationships between objects and attributes through the interval linguistic-valued intuitionistic fuzzy concept lattice. The linguistic association rules can be extracted through the intent of the parent and child concept nodes of the concept lattice to generate user understandable interest and obtain user feedback on the assessment logic.

5. Comparative Analysis and Discussion

In this section, we provide a comparative analysis of our proposed approach, LARE, with several other association rule extraction approaches based on key dimensions such as starting point, rule type, background knowledge, and downstream task applicability.
We compare our approach, LARE, with several other association rule extraction approaches, including the Association Rule Mining approach based on Fuzzy Concept Lattice (ARM-FCL) [27], the Fuzzy Association Rule Mining approach based on Hedge Algebras (FARM-HA) [31], the Obtain Positive and Negative Classification Rules approach (OPNCR) [32], the Association Rule Mining approach based on Concept Lattice (ARM-CL) [29], and the Association Rules Generation with Designated Consequence approach (ARGDC) [33]. A comparison of the results of these approaches is presented in Table 4.
According to Table 4, we compare our proposed approach with other association rule extraction approaches across four key dimensions:
  • Starting point: Among the various association rule extraction approaches, LARE is unique in being based on the interval linguistic-valued intuitionistic fuzzy concept lattice. This structure allows LARE to explicitly handle the inherent uncertainty in linguistic values while analyzing the relationships between users and items from both positive and negative perspectives. In contrast, three other approaches—OPNCR, ARM-CL, and ARGDC—derive association rules using concept lattices, which focus on capturing the hierarchical relationships among concepts. FARM-HA, on the other hand, extracts association rules from a transaction database combined with a qualitative evaluation table. Unlike transaction databases, concept lattices offer a way to visualize the generalization and specialization relationships between concepts, making it easier to pinpoint relevant nodes for association rule extraction. Notably, ARM-FCL, based on fuzzy concept lattices, accounts for the fuzzy relationships between users and items, further emphasizing the adaptability of concept lattices in modeling complex relationships.
  • Rule type: Several approaches (OPNCR, ARM-CL, ARGDC) rely on Boolean values for association rule extraction. While effective for crisp, binary relationships, Boolean-based approaches have limitations in capturing the uncertain and graded relationships between users and items. ARM-FCL introduces fuzzy values to model these relationships, providing a more nuanced understanding of the degrees of association. However, none of these approaches can process qualitative linguistic-valued data. Both FARM-HA and LARE overcome this limitation by directly representing linguistic-valued data: FARM-HA utilizes qualitative evaluation tables, while LARE employs interval linguistic-valued intuitionistic fuzzy sets. In this way, these approaches reduce information loss caused by the transformation of linguistic-valued data into numerical formats, preserving the richness of the original linguistic information.
  • Background knowledge: Four of the approaches do not incorporate background knowledge into the rule extraction process. FARM-HA stands out by using a qualitative evaluation table as background knowledge, guiding association rule extraction in transaction databases through hedge algebras. In comparison, LARE leverages the semantic ordering of linguistic terms as background knowledge. This allows LARE to guide the extraction of association rules within the interval linguistic-valued intuitionistic fuzzy concept lattice, incorporating both positive and negative linguistic information. This dual-sided analysis provides a more comprehensive understanding of the relationships embedded in the data, making LARE more versatile than approaches like FARM-HA that rely on a single perspective.
  • Downstream task: While ARM-FCL, FARM-HA, and LARE are not directly applied to specific downstream tasks, approaches like ARM-CL, OPNCR, and ARGDC, which are based on concept lattices, have been successfully applied to practical areas such as recommender systems, text mining, and materials research:
    • ARM-CL leverages association rule mining within concept lattices to improve recommendation accuracy. For instance, in e-commerce platforms, ARM-CL can analyze users’ purchase histories to generate association rules that suggest potential items of interest. If a user has purchased items A and B, the system may recommend item C based on discovered rules such as { A , B } C , derived from the concept lattice.
    • OPNCR is effectively used in text mining to uncover patterns and topics within textual data. For example, in news article classification, OPNCR can generate a concept lattice based on the logical relationships between words and sentences. Articles containing keywords like “economy”, “growth”, and “stocks” could be automatically categorized under the “finance” section, helping streamline large-scale text processing.
    • ARGDC has shown promise in materials science for exploring correlations between material properties and performance. In material design, concept lattices constructed by ARGDC help identify relationships between attributes such as density and thermal conductivity, and performance metrics like hardness and electrical conductivity. By analyzing historical material data, ARGDC can suggest new material combinations that meet specific performance criteria, accelerating the discovery of novel materials.
    This highlights the flexibility and utility of concept lattice-based approaches for association rule extraction, particularly in domains where visualization, interpretability, and portability are crucial. The ability to translate extracted rules into actionable insights demonstrates the practical advantages of using concept lattices in real-world applications, further underscoring the potential for LARE in future downstream tasks.
In summary, while traditional methods like ARM-FCL and FARM-HA have contributed to the advancement of association rule mining in fuzzy and hybrid contexts, they exhibit certain limitations when handling complex, qualitative information. These limitations include a reliance on fixed numerical thresholds, insufficient flexibility in processing linguistic uncertainty, and suboptimal performance in highly dynamic environments.
In contrast, the proposed LARE algorithm leverages interval linguistic-valued intuitionistic fuzzy sets to overcome these challenges. By integrating the concept lattice framework with linguistic membership and confidence thresholds, LARE excels in the following:
  • Accurately capturing qualitative nuances inherent in human decision making.
  • Generating more interpretable and meaningful rules that align with real-world linguistic descriptions.
  • Enhancing computational efficiency by reducing redundant rules and focusing on high-confidence implications.
Future research could explore applying LARE to specific downstream tasks like recommender systems, building on its dual-sided analysis of linguistic information.

6. Conclusions

In this paper, we propose a novel construction algorithm for the interval linguistic-valued intuitionistic fuzzy concept lattice, building on the foundations of interval intuitionistic fuzzy sets and FCA. We also explore the key properties of the interval linguistic-valued intuitionistic fuzzy concept lattice, providing a theoretical basis for its application. On the basis of this lattice, we further introduce a linguistic association rule extraction algorithm. The interval linguistic-valued intuitionistic fuzzy concept lattice captures linguistic information from both positive and negative perspectives, thereby reducing information loss commonly encountered in other approaches.
By leveraging the partial order relationships between interval linguistic-valued intuitionistic fuzzy concepts, the proposed algorithm is capable of extracting higher-quality linguistic association rules. These rules are not only more nuanced but also reflect the complex interrelationships between concepts, enhancing the overall effectiveness of association rule mining in environments characterized by imprecision and vagueness. This approach offers significant advantages in terms of capturing the full spectrum of linguistic information, improving both the interpretability and practical applicability of the mined association rules.
With the increasing volume of data, it is becoming essential to consider the reduction approach for the interval linguistic-valued intuitionistic fuzzy concept lattice to ensure its practical application in real-world scenarios. This reduction technique would aim to minimize the generation of redundant linguistic association rules, enhancing the efficiency and relevance of the rules derived from the lattice. Furthermore, compared to concept lattices, the interval linguistic-valued intuitionistic fuzzy concept lattice is significantly larger in scale, leading to increased computational complexity. Addressing this issue requires the development of effective pruning techniques to simplify the structure of the lattice, reducing its complexity while maintaining the integrity of the linguistic information. Future research should focus on exploring these reduction and pruning strategies to make the interval linguistic-valued intuitionistic fuzzy concept lattice more scalable and applicable in large-scale data environments. These improvements would not only streamline the construction process but also enhance the practicality of the lattice in applications such as data mining, recommendation systems, and decision-making processes.

Author Contributions

Conceptualization, L.Z.; formal analysis, C.F.; methodology, G.W.; supervision, M.L.; writing—original draft, K.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the National Natural Science Foundation of P.R. China (Nos. 62372077, 62176142).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

The Appendix briefly recalls the concepts of FCA, interval intuitionistic fuzzy sets, and linguistic term sets.
Definition A1
([1]). A formal context is a triple U , A , I , where U = x 1 , x 2 , , x m is a set of objects, A = a 1 , a 2 , , a n is a set of attributes, and I is a binary relation between U and A. For any x U and a A , we write x , a I as x I a , and say that the object x has the attribute a. Alternatively, the attribute a is possessed by the object x.
Definition A2
([1]). Let U , A , I be a formal context; a formal concept is a pair X , B where X U and B A such that X = B and X = B . X and B are, respectively, the extent and intent of X , B ; two operators “↑” and “↓” can be defined as follows:
( ) : 2 U 2 A ,
X = a | a A , x X , ( x , a ) I ,
( ) : 2 A 2 U ,
B = x | x U , a B , ( x , a ) I .
We denote the set consisting of all concepts of the formal context U , A , I as L U , A , I . For ( X 1 , B 1 ) , ( X 2 , B 2 ) L U , A , I , the partial order “≤” can be defined as follows:
X 1 , B 1 X 2 , B 2 X 1 X 2 B 2 B 1 ,
( L U , A , I , ) form a complete concept lattice which is called a concept lattice of ( U , A , I ) .
Example A1.
A formal context ( U , A , I ) is depicted in Table A1, where U = { x 1 , x 2 , x 3 , x 4 , x 5 } , A = { a , b , c , d } . The related concept lattice based on the Galois connection ( , ) under the context is shown in Figure A1.
Table A1. A formal context ( U , A , I ) .
Table A1. A formal context ( U , A , I ) .
Uabcd
x 1 ×× ×
x 2 × ×
x 3 ××
x 4 × ×
x 5 ××
Figure A1. Concept lattice L U , A , I .
Figure A1. Concept lattice L U , A , I .
Axioms 13 00812 g0a1
Definition A3
([1]). Let L 1 U , A 1 , I 1 and L 2 U , A 2 , I 2 be two concept lattices. For any X 1 , B 1 L 1 U , A 1 , I 1 , if there exists X 2 , B 2 L 2 U , A 2 , I 2 , so that X 1 = X 2 , then we say L 1 U , A 1 , I 1 L 2 U , A 2 , I 2 .
If L 1 U , A 1 , I 1 L 2 U , A 2 , I 2 and L 2 U , A 2 , I 2 L 1 U , A 1 , I 1 , then these two concept lattices are isomorphic, denoted as L 1 U , A 1 , I 1 L 2 U , A 2 , I 2 .
Definition A4
([34]). Let S = s θ | θ = 0 , 1 , g be a linguistic term set consisting of an odd number of linguistic terms, where g + 1 is the granularity of the linguistic term set, then S satisfies the following properties:
1. 
Order: s α > s β α > β .
2. 
Negative operator: N e g ( s α ) = s β , where β = g α .
3. 
Maximal operator: If α β , then m a x ( s α , s β ) = s α .
4. 
Minimal operator: If α β , then m i n ( s α , s β ) = s β .
For example, when θ = 5 , the linguistic term set S can be expressed as
S = { s 0 = s t r o n g l y d i s a g r e e , s 1 = s o m e w h a t d i s a g r e e , s 2 = n e u t r a l , s 3 = s o m e w h a t a g r e e , s 4 = s t r o n g l y a g r e e } .
For any two linguistic terms s α , s β S and λ , λ 1 , λ 2 0 , 1 , the operations between linguistic terms are defined as
  • s α s β = s α + β ;
  • λ s α = s λ α ;
  • λ 1 + λ 2 s α = λ 1 s α λ 2 s α ;
  • λ s α s β = λ s α λ s β .
In order to facilitate the computation between specific linguistic terms, Xu et al. [35] extended the discrete linguistic term set to a continuous linguistic term set.
S ¯ = s θ | θ 0 , g ,
where S ¯ also satisfies the above conditions, denoted as
S 0 , g = s 0 , s g .
Definition A5
([13]). Let X be the universe of discourse, then an interval-valued intuitionistic fuzzy set A on X is defined as follows:
A = x , μ x , ν x | x X ,
where μ x = [ μ A x , μ A + x ] and ν x = [ ν A x , ν A + x ] are respectively expressed as the membership degree and the non-membership degree of A. For all x X on A, 0 μ A + x + ν A + x 1 . We say π A x = [ 1 μ A + x ν A + x , 1 μ A x ν A x ] is the interval intuitionistic fuzzy hesitation degree of A. We denote all interval-valued intuitionistic fuzzy sets on X as I V I F S X .
The operation between any two interval-valued intuitionistic fuzzy sets A , B I V I F S X is defined as follows:
1. 
A c = { x , [ ν A x , ν A + x ] , [ μ A x , μ A + x ] x X } is the complement of A;
2. 
A B = { x , [ μ A ( x ) μ B ( x ) , μ A + ( x ) μ B + ( x ) ] , [ ν A ( x ) ν B ( x ) , ν A + ( x ) ν B + ( x ) ] | x X } ;
3. 
A B = { x , [ μ A ( x ) μ B ( x ) , μ A + ( x ) μ B + ( x ) ] , [ ν A ( x ) ν B ( x ) , ν A + ( x ) ν B + ( x ) ] | x X } ;
4. 
A B x X , μ A x , μ A + x μ B x , μ B + x , ν A x , ν A + x ν B x , ν B + x ;
5. 
A = B A B , B A .
Example A2.
Let A = [ 0.2 , 0.44 ] , [ 0.36 , 0.56 ] and B = [ 0.47 , 0.77 ] , [ 0 , 0.23 ] be two interval-valued intuitionistic fuzzy sets, then
1. 
A c = [ 0.36 , 0.56 ] , [ 0.2 , 0.44 ] ;
2. 
A B = [ 0.47 , 0.77 ] , [ 0 , 0.23 ] ;
3. 
A B = [ 0.2 , 0.44 ] , [ 0.36 , 0.56 ] .

References

  1. Wille, R. Restructuring lattice theory: An approach based on hierarchies of concepts. In Proceedings of the Formal Concept Analysis: 7th International Conference, ICFCA 2009, Proceedings 7, Darmstadt, Germany, 21–24 May 2009; pp. 314–339. [Google Scholar]
  2. Zhai, Y.; Wang, T.; Li, D. Robust Variable Threshold Fuzzy Concept Lattice with Application to Medical Diagnosis. Int. J. Fuzzy Syst. 2024, 26, 344–356. [Google Scholar] [CrossRef]
  3. Cornejo, M.E.; Medina, J.; Ocaña, F.J. Attribute implications in multi-adjoint concept lattices with hedges. Fuzzy Sets Syst. 2024, 479, 108854. [Google Scholar] [CrossRef]
  4. Zhang, T.; Lin, L.; Xue, Z. A voice feature extraction method based on fractional attribute topology for Parkinson’s disease detection. Expert Syst. Appl. 2023, 219, 119650. [Google Scholar] [CrossRef]
  5. Yan, E.; Song, J.; Ren, Y.; Zheng, C.; Mi, B.; Hong, W. Construction of three-way attribute partial order structure via cognitive science and granular computing. Knowl.-Based Syst. 2020, 197, 105859. [Google Scholar] [CrossRef]
  6. Pang, K.; Zou, L.; Kang, N.; Li, S.; Lu, M. The construction of fuzzy linguistic attribute partial ordered structure diagram. Comput. Appl. Math. 2023, 42, 240. [Google Scholar] [CrossRef]
  7. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef]
  8. Ma, Z.; Yan, L. Data modeling and querying with fuzzy sets: A systematic survey. Fuzzy Sets Syst. 2022, 445, 147–183. [Google Scholar] [CrossRef]
  9. Mendel, J.M. On computing the similarity of trapezoidal fuzzy sets using an Automated Area Method. Inf. Sci. 2022, 589, 716–737. [Google Scholar] [CrossRef]
  10. Molla, M.U.; Giri, B.C.; Biswas, P. Extended PROMETHEE method with Pythagorean fuzzy sets for medical diagnosis problems. Soft Comput. 2021, 25, 4503–4512. [Google Scholar] [CrossRef]
  11. Garai, A.; Mondal, B.; Roy, T.K. Optimisation of multi-objective commercial bank balance sheet management model: A parametric T-set approach. Int. J. Math. Oper. Res. 2019, 15, 395–416. [Google Scholar] [CrossRef]
  12. Garai, A.; Roy, T.K. Multi-objective optimization of cost-effective and customer-centric closed-loop supply chain management model in T-environment. Soft Comput. 2020, 24, 155–178. [Google Scholar] [CrossRef]
  13. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  14. Alreshidi, N.A.; Shah, Z.; Khan, M.J. Similarity and entropy measures for circular intuitionistic fuzzy sets. Eng. Appl. Artif. Intell. 2024, 131, 107786. [Google Scholar] [CrossRef]
  15. Yang, J.; Yao, Y. A three-way decision based construction of shadowed sets from Atanassov intuitionistic fuzzy sets. Inf. Sci. 2021, 577, 1–21. [Google Scholar] [CrossRef]
  16. Garg, H.; Dutta, D.; Dutta, P.; Gohain, B. An extended group decision-making algorithm with intuitionistic fuzzy set information distance measures and their applications. Comput. Ind. Eng. 2024, 197, 110537. [Google Scholar] [CrossRef]
  17. Atanassov, K.; Gargov, G. Interval valued intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 31, 343–349. [Google Scholar] [CrossRef]
  18. Boffa, S.; Ciucci, D. Three-way decisions with evaluative linguistic expressions. Int. J. Approx. Reason. 2024, 164, 109080. [Google Scholar] [CrossRef]
  19. Yang, Y.; Jie, M.Q.; Chen, Z.S. Dynamic three-way multi-criteria decision making with basic uncertain linguistic information: A case study in product ranking. Appl. Soft Comput. 2024, 152, 111228. [Google Scholar] [CrossRef]
  20. Xu, Y.; Chen, S.; Liu, J.; Ruan, D. Weak completeness of resolution in a linguistic truth-valued propositional logic. In Theoretical Advances and Applications of Fuzzy Logic and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2007; pp. 358–366. [Google Scholar]
  21. Liao, H.; Xu, Z.; Zeng, X.J. Distance and similarity measures for hesitant fuzzy linguistic term sets and their application in multi-criteria decision making. Inf. Sci. 2014, 271, 125–142. [Google Scholar] [CrossRef]
  22. Pang, K.; Martínez, L.; Li, N.; Liu, J.; Zou, L.; Lu, M. A concept lattice-based expert opinion aggregation method for multi-attribute group decision-making with linguistic information. Expert Syst. Appl. 2024, 237, 121485. [Google Scholar] [CrossRef]
  23. Pang, K.; Lu, Y.; Martínez, L.; Pedrycz, W.; Zou, L.; Lu, M. A conceptual clustering method for large-scale group decision-making with linguistic truth-valued lattice implication algebra. Appl. Soft Comput. 2024, 155, 111418. [Google Scholar] [CrossRef]
  24. Zou, L.; Pang, K.; Song, X.; Kang, N.; Liu, X. A knowledge reduction approach for linguistic concept formal context. Inf. Sci. 2020, 524, 165–183. [Google Scholar] [CrossRef]
  25. Zou, L.; Kang, N.; Che, L.; Liu, X. Linguistic-valued layered concept lattice and its rule extraction. Int. J. Mach. Learn. Cybern. 2022, 13, 83–98. [Google Scholar] [CrossRef]
  26. Zou, L.; Lin, H.; Song, X.; Feng, K.; Liu, X. Rule extraction based on linguistic-valued intuitionistic fuzzy layered concept lattice. Int. J. Approx. Reason. 2021, 133, 1–16. [Google Scholar] [CrossRef]
  27. Zou, C.; Deng, H.; Wan, J.; Wang, Z.; Deng, P. Mining and updating association rules based on fuzzy concept lattice. Future Gener. Comput. Syst. 2018, 82, 698–706. [Google Scholar] [CrossRef]
  28. Pang, K.; Li, S.; Lu, Y.; Kang, N.; Zou, L.; Lu, M. Association rule mining with fuzzy linguistic information based on attribute partial ordered structure. Soft Comput. 2023, 27, 17447–17472. [Google Scholar] [CrossRef]
  29. Zou, C.; Zhang, D.; Wan, J.; Hassan, M.M.; Lloret, J. Using concept lattice for personalized recommendation system design. IEEE Syst. J. 2015, 11, 305–314. [Google Scholar] [CrossRef]
  30. Zhi, H.; Li, J. Influence of dynamical changes on concept lattice and implication rules. Int. J. Mach. Learn. Cybern. 2018, 9, 795–805. [Google Scholar] [CrossRef]
  31. Le Anh, P.; Tran, K.; Vinh Trung, N. New Approach to Mining Fuzzy Association Rule with Linguistic Threshold Based on Hedge Algebras. In Proceedings of the 2nd International Workshop on Semantic Technologies (IWOST2), Bangkok, Thailand, 2–3 November 2015; Volume 1494. [Google Scholar]
  32. Chen, X.; Qi, J.; Zhu, X.; Wang, X.; Wang, Z. Unlabelled text mining methods based on two extension models of concept lattices. Int. J. Mach. Learn. Cybern. 2020, 11, 475–490. [Google Scholar] [CrossRef]
  33. Sheng, Q.; Qian, Q. Mining materials knowledge with concept lattice algorithm. Mater. Today Commun. 2020, 22, 100726. [Google Scholar] [CrossRef]
  34. Herrera, F.; Herrera-Viedma, E. A model of consensus in group decision making under linguistic assessments. Fuzzy Sets Syst. 1996, 78, 73–87. [Google Scholar] [CrossRef]
  35. Xu, Z.S. Deviation measures of linguistic preference relations in group decision making. Omega 2005, 33, 249–254. [Google Scholar] [CrossRef]
Figure 1. Interval linguistic-valued intuitionistic fuzzy concept lattice M ¯ I F L L U , A , S * .
Figure 1. Interval linguistic-valued intuitionistic fuzzy concept lattice M ¯ I F L L U , A , S * .
Axioms 13 00812 g001
Table 1. Interval linguistic-valued intuitionistic fuzzy formal context U , A , S * .
Table 1. Interval linguistic-valued intuitionistic fuzzy formal context U , A , S * .
Uabcd
x 1 s 1 , s 3 , s 4 , s 5 s 4 , s 6 , s 1 , s 2 s 4 , s 5 , s 0 , s 3 s 5 , s 6 , s 1 , s 2
x 2 s 3 , s 4 , s 1 , s 3 s 4 , s 6 , s 0 , s 2 s 4 , s 4 , s 2 , s 3 s 5 , s 7 , s 0 , s 1
x 3 s 6 , s 7 , s 0 , s 1 s 3 , s 4 , s 1 , s 2 s 4 , s 5 , s 0 , s 3 s 4 , s 6 , s 0 , s 2
x 4 s 4 , s 6 , s 1 , s 2 s 2 , s 4 , s 3 , s 4 s 2 , s 3 , s 4 , s 5 s 5 , s 7 , s 0 , s 1
x 5 s 4 , s 5 , s 0 , s 3 s 4 , s 6 , s 1 , s 2 s 4 , s 5 , s 2 , s 3 s 5 , s 6 , s 0 , s 1
Table 2. All interval linguistic-valued intuitionistic fuzzy concepts.
Table 2. All interval linguistic-valued intuitionistic fuzzy concepts.
IndexExtentIntent
0 # { s 5 , s 6 , s 0 , s 2 , s 5 , s 7 , s 0 , s 1 , s 6 , s 7 , s 0 , s 1 , s 5 , s 7 , s 0 , s 1 , s 5 , s 6 , s 0 , s 1 }
1 # { s 1 , s 3 , s 4 , s 5 , s 3 , s 4 , s 1 , s 3 , s 6 , s 7 , s 0 , s 1 , s 4 , s 6 , s 1 , s 2 , s 4 , s 5 , s 0 , s 3 } { a }
2 # { s 4 , s 5 , s 0 , s 3 , s 4 , s 4 , s 2 , s 3 , s 4 , s 5 , s 0 , s 3 , s 2 , s 3 , s 4 , s 5 , s 4 , s 5 , s 2 , s 3 } { c }
3 # { s 5 , s 6 , s 0 , s 2 , s 5 , s 7 , s 0 , s 1 , s 4 , s 6 , s 0 , s 2 , s 5 , s 7 , s 0 , s 1 , s 5 , s 6 , s 0 , s 1 } { d }
4 # { s 4 , s 6 , s 1 , s 2 , s 4 , s 6 , s 0 , s 2 , s 3 , s 4 , s 1 , s 2 , s 2 , s 4 , s 3 , s 4 , s 4 , s 6 , s 1 , s 2 } { b , d }
5 # { s 4 , s 5 , s 1 , s 3 , s 4 , s 4 , s 2 , s 3 , s 4 , s 5 , s 0 , s 3 , s 2 , s 3 , s 4 , s 5 , s 4 , s 5 , s 2 , s 3 } { c , d }
6 # { s 1 , s 3 , s 4 , s 5 , s 3 , s 4 , s 1 , s 3 , s 3 , s 4 , s 1 , s 2 , s 2 , s 4 , s 3 , s 4 , s 4 , s 5 , s 1 , s 3 } { a , b , d }
7 # { s 4 , s 5 , s 1 , s 3 , s 4 , s 4 , s 2 , s 3 , s 3 , s 4 , s 1 , s 3 , s 2 , s 3 , s 4 , s 5 , s 4 , s 5 , s 2 , s 3 } { b , c , d }
8 # { s 1 , s 3 , s 4 , s 5 , s 3 , s 4 , s 2 , s 3 , s 4 , s 5 , s 0 , s 3 , s 2 , s 3 , s 4 , s 5 , s 4 , s 5 , s 2 , s 3 } { a , c , d }
9 # { s 1 , s 3 , s 4 , s 5 , s 3 , s 4 , s 2 , s 3 , s 3 , s 4 , s 1 , s 3 , s 2 , s 3 , s 4 , s 5 , s 4 , s 5 , s 2 , s 3 } { a , b , c , d }
Table 3. The linguistic association rule set R s .
Table 3. The linguistic association rule set R s .
Index R s E ( B 1 ) E ( B 2 ) Conf ( R )
0 { c , d } { a } s 4.60 s 4.15 0.90
1 { c , d } { b } s 4.65 s 4.60 0.99
2 { b , d } { c } s 5.20 s 4.65 0.89
3 { b , d } { a } s 5.20 s 4.30 0.83
4 { c } { d } s 4.75 s 4.60 0.97
Table 4. Comparison of different approaches.
Table 4. Comparison of different approaches.
ApproachStarting Point 1Rule Type 2Background Knowledge 3Downstream Task 4
ARM-FCLFuzzy concept latticeFuzzy valuesNoNone
FARM-HATransactional database, qualitative evaluation tableLinguistic valuesYesNone
OPNCRConcept latticeBoolean valuesNoText mining
ARM-CLConcept latticeBoolean valuesNoRecommendation system
ARGDCConcept latticeBoolean valuesNoMaterials research
LAREInterval linguistic-valued intuitionistic fuzzy concept latticeLinguistic valuesYesNone
1 Starting point: The initial data structure or framework used. 2 Rule type: The type of rules generated or used in the approach. 3 Background knowledge: Indicates whether the approach leverages background knowledge. 4 Downstream task: The specific application or domain where the approach is applied.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Pang, K.; Fu, C.; Zou, L.; Wang, G.; Lu, M. Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice and Its Application to Linguistic Association Rule Extraction. Axioms 2024, 13, 812. https://doi.org/10.3390/axioms13120812

AMA Style

Pang K, Fu C, Zou L, Wang G, Lu M. Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice and Its Application to Linguistic Association Rule Extraction. Axioms. 2024; 13(12):812. https://doi.org/10.3390/axioms13120812

Chicago/Turabian Style

Pang, Kuo, Chao Fu, Li Zou, Gaoxuan Wang, and Mingyu Lu. 2024. "Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice and Its Application to Linguistic Association Rule Extraction" Axioms 13, no. 12: 812. https://doi.org/10.3390/axioms13120812

APA Style

Pang, K., Fu, C., Zou, L., Wang, G., & Lu, M. (2024). Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice and Its Application to Linguistic Association Rule Extraction. Axioms, 13(12), 812. https://doi.org/10.3390/axioms13120812

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop