Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Modal-style operators in qualitative data analysis
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Recovering UML class models from C++: A detailed explanation
Information and Software Technology
A multiview approach for intelligent data analysis based on data operators
Information Sciences: an International Journal
Relations of attribute reduction between object and property oriented concept lattices
Knowledge-Based Systems
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Representing lattices using many-valued relations
Information Sciences: an International Journal
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
Granular Computing and Knowledge Reduction in Formal Contexts
IEEE Transactions on Knowledge and Data Engineering
A novel approach to attribute reduction in concept lattices
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
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
Hi-index | 0.00 |
Konwledge reduction on concept lattices is an important research topic in formal concept analysis, and there are some different meanings and methods. This paper mainly studies the granular reduction of property-oriented concept lattices which can preserve the property-oriented concepts, which is called granules in this paper. Firstly, the granules of a property-oriented concept lattice is presented, and it is proven that each extension of property-oriented concepts can be constructed by the granules. Then, the granular reduction of a property-oriented concept lattice is proposed, and the granular discernibility attribute matrix and the granular discernibility attribute function are respectively employed to determine granular consistent sets and calculate granular reducts. Finally, the relation between a granular consistent set and a lattice consistent set of a property-oriented concept lattice is discussed.