Information flow: the logic of distributed systems
Information flow: the logic of distributed systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
TOSCANA - a Graphical Tool for Analyzing and Exploring Data
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Concepts in fuzzy scaling theory: order and granularity
Fuzzy Sets and Systems - Possibility theory and fuzzy logic
Approaches to attribute reduction in concept lattices induced by axialities
Knowledge-Based Systems
Attribute reduction based on the extension concept lattice
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Applications of temporal conceptual semantic systems
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
Rough fuzzy set approximations in fuzzy formal contexts
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Approximation in formal concept analysis
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
States, transitions, and life tracks in temporal concept analysis
Formal Concept Analysis
Relationships between concept lattice and rough set
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Turing machine representation in temporal concept analysis
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Approaches to knowledge reduction in generalized consistent decision formal context
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Basic relationships between Rough Set Theory (RST) and Formal Concept Analysis (FCA) are discussed. Differences between the "partition oriented" RST and the "order oriented" FCA concerning the possibility of knowledge representation are investigated. The fundamental connection between RST and FCA is that the knowledge bases of RST and the scaled many-valued contexts of FCA are shown to be nearly equivalent.