Considering the Relationship between RST and FCA
Chongyang Shi, Zhendong Niu, Tao Wang
Abstract
Chongyang Shi, Zhendong Niu, Tao Wang
Abstract
Formal Concept Analysis and Rough Set Theory provide two different methods for data analysis and knowledge processing. The basis of Rough Set Theory is an equivalence relation on a universe of objects, and that of Formal Concept Analysis is an ordered hierarchical structure - concept lattice. This paper discusses the basic connection between Formal Concept Analysis and Rough Set Theory, and then we study some relationship between the extensions of concept lattice and the equivalence class in Rough Set Theory. Finally, by introducing the term of feasible and unfeasible formal context, we know their relation more deeply.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Formal Concept Analysis and Rough Set Theory provide two different methods for data analysis and knowledge processing. The basis of Rough Set Theory is an equivalence relation on a universe of objects, and that of Formal Concept Analysis is an ordered hierarchical structure - concept lattice. This paper discusses the basic connection between Formal Concept Analysis and Rough Set Theory, and then we study some relationship between the extensions of concept lattice and the equivalence class in Rough Set Theory. Finally, by introducing the term of feasible and unfeasible formal context, we know their relation more deeply.
Key concepts: Formal concept analysis, Rough set, Lattice Miner, Equivalence relation, Dominance-based rough set approach, Computer science, Theoretical computer science, Lattice (music)