An Efficient Algorithm for Batch Attribute Insertion in Fuzzy Concept Lattice Construction: Overcoming Extent Loss and Optimizing Path Matching in Dynamic Fuzzy Concept Lattices
This paper proposes an algorithm for batch insertion of new attributes into concept lattices. By constructing parent nodes and leveraging shared intents between nodes, we integrate new nodes without losing extent features, enhancing efficiency over previous methods. This enables concurrent construction of fuzzy concept lattices useful for deriving association rules. Experiments show our algorithm reduces redundant insertion paths without losing attribute extents.
Authors
- Junjun Feng (ORCID: https://orcid.org/0000-0003-4933-9083)
- Jin Guo (ORCID: https://orcid.org/0000-0001-6909-3581)
- Wei Gao (ORCID: https://orcid.org/0000-0003-2414-9216)
- Li Zou (ORCID: https://orcid.org/0000-0002-7715-1603)
Institutions
- Liaoning Normal University (CN)
- Shandong Jianzhu University (CN)
Publication Details
- Published
- 2024-09-27
- DOI
- https://doi.org/10.1109/eiecs63941.2024.10800364
- Citations
- 1
- Primary Topic
- Data Management and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.35
Funders
- National Natural Science Foundation of China