Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice and Its Application to Linguistic Association Rule Extraction
Abstract
:1. Introduction
- 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.
2. Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice
2.1. The Construction of the Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice
- 1.
- is the complement of ;
- 2.
- ;
- 3.
- ;
- 4.
- .
- 1.
- ;
- 2.
- ;
- 3.
- ;
- 4.
- ;
- 5.
- ;
- 6.
- .
- 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
Algorithm 1: IVI-FCLG |
Input: Interval linguistic-valued intuitionistic fuzzy formal context Output: Interval linguistic-valued intuitionistic fuzzy concept lattice |
3. Linguistic Association Rule Extraction Based on Interval Linguistic-Valued Intuitionistic Fuzzy Concept Lattice
- 2.
- The confidence reflects the probability that the consequent of the association rule appears when the antecedent is present. A higher confidence value indicates a more reliable association between the antecedent and the consequent in the linguistic association rule extraction.
Algorithm 2: LARE |
- Exponential growth in subset calculation: Generating subsets for attributes () poses a major challenge when 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 () 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.
- 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
4.1. Background Description
4.2. Problem Solution
5. Comparative Analysis and Discussion
- 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 , 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.
- 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.
6. Conclusions
Author Contributions
Funding
Data Availability Statement
Conflicts of Interest
Appendix A
U | a | b | c | d |
---|---|---|---|---|
× | × | × | ||
× | × | |||
× | × | |||
× | × | |||
× | × |
- 1.
- Order: .
- 2.
- Negative operator: , where .
- 3.
- Maximal operator: If , then .
- 4.
- Minimal operator: If , then .
- ;
- ;
- ;
- .
- 1.
- is the complement of A;
- 2.
- ;
- 3.
- ;
- 4.
- ;
- 5.
- .
- 1.
- ;
- 2.
- ;
- 3.
- .
References
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef]
- Ma, Z.; Yan, L. Data modeling and querying with fuzzy sets: A systematic survey. Fuzzy Sets Syst. 2022, 445, 147–183. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- 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]
- Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- Atanassov, K.; Gargov, G. Interval valued intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 31, 343–349. [Google Scholar] [CrossRef]
- Boffa, S.; Ciucci, D. Three-way decisions with evaluative linguistic expressions. Int. J. Approx. Reason. 2024, 164, 109080. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Sheng, Q.; Qian, Q. Mining materials knowledge with concept lattice algorithm. Mater. Today Commun. 2020, 22, 100726. [Google Scholar] [CrossRef]
- 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]
- Xu, Z.S. Deviation measures of linguistic preference relations in group decision making. Omega 2005, 33, 249–254. [Google Scholar] [CrossRef]
U | a | b | c | d |
---|---|---|---|---|
Index | Extent | Intent |
---|---|---|
∅ | ||
Index | ||||
---|---|---|---|---|
0 | 0.90 | |||
1 | 0.99 | |||
2 | 0.89 | |||
3 | 0.83 | |||
4 | 0.97 |
Approach | Starting Point 1 | Rule Type 2 | Background Knowledge 3 | Downstream Task 4 |
---|---|---|---|---|
ARM-FCL | Fuzzy concept lattice | Fuzzy values | No | None |
FARM-HA | Transactional database, qualitative evaluation table | Linguistic values | Yes | None |
OPNCR | Concept lattice | Boolean values | No | Text mining |
ARM-CL | Concept lattice | Boolean values | No | Recommendation system |
ARGDC | Concept lattice | Boolean values | No | Materials research |
LARE | Interval linguistic-valued intuitionistic fuzzy concept lattice | Linguistic values | Yes | None |
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. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
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
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 StylePang, 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 StylePang, 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