Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Rough Sets and Concept Lattices
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
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft 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
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
Transactions on Rough Sets III
Relations of attribute reduction between object and property oriented concept lattices
Knowledge-Based Systems
Concept Lattices of Subcontexts of a Context
Fundamenta Informaticae
Knowledge Reduction in Concept Lattices Based on Irreducible Elements
Transactions on Computational Science V
The Reduction Theory of Object Oriented Concept Lattices and Property Oriented Concept Lattices
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
A novel approach to attribute reduction in formal concept lattices
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Granular reduction of property-oriented concept lattices
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Concept Lattices of Subcontexts of a Context
Fundamenta Informaticae
The strong direct product of formal contexts
Information Sciences: an International Journal
Hi-index | 0.00 |
Concept lattice is an effective tool for data analysis and knowledge discovery. Since one of the key problems of knowledge discovery is knowledge reduction, it is very necessary to look for a simple and effective approach to knowledge reduction. In this paper, we develop a novel approach to attribute reduction by defining a partial relation and partial classes to generate concepts and introducing the notion of meet-irreducible element in concept lattice. Some properties of meet-irreducible element are presented. Furthermore, we analyze characteristics of attributes and obtain sufficient and necessary conditions of the characteristics of attributes. In addition, we illustrate that adopting partial classes to generate concepts and the approach to attribute reduction are simpler and more convenient compared with current approaches