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
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
On the Treatment of Incomplete Knowledge in Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
A Formal Concept Analysis Approach to Rough Data Tables
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Efficient mining of association rules based on formal concept analysis
Formal Concept Analysis
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
Exploring Users' Preferences in a Fuzzy Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |
In order to handle very large data bases efficiently, the data warehousing system ICE [1] builds so-called rough tables containing information that is abstracted from certain blocks of the original table. In this article we propose a formal description of such rough tables. We also investigate possibilities of mining them for implicational knowledge. The underyling article is an extended version of [2].