Matrix theory: a second course
Matrix theory: a second course
The ubiquitous Kronecker product
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Concept Approximation in Concept Lattice
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Modal-style operators in qualitative data analysis
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Concept analysis via rough set and AFS algebra
Information Sciences: an International Journal
A novel approach to attribute reduction in concept lattices
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
A partitional view of concept lattice
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Attribute reduction in concept lattice based on discernibility matrix
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Rough Concept Analysis: A Synthesis Of Rough Sets And Formal Concept Analysis
Fundamenta Informaticae
| Hi-index | 0.07 |
The theory of Formal Concept Analysis is used as a knowledge representation mechanism and as a conceptual clustering method. Formal context is a basic notion in this theory. This paper proposes a kind of formal context, called n-Strong-Direct-Product-Formal-Context (n-SDPFC, for short), by the strong direct product of n formal contexts. It is found that the new context is closely related to the n original formal contexts in many aspects, for example, the concept lattices, and the implications between attributes, and so on. With the help of Kronecker product of boolean matrices, the main features of an n-SDPFC is given, and the method how to represent a formal context with such features by the strong direct product of some small formal contexts is brought forward. With this method, the workload for knowledge acquisition in formal context will be eased enormously.