Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Concept Approximation in Concept Lattice
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Approaches to knowledge reduction based on variable precision rough set model
Information Sciences—Informatics and Computer Science: An International Journal - Mining stream data
Reduction method for concept lattices based on rough set theory and its application
Computers & Mathematics with Applications
On Three Types of Covering-Based Rough Sets
IEEE Transactions on Knowledge and Data Engineering
Attribute reduction based on evidence theory in incomplete decision systems
Information Sciences: an International Journal
Relations of attribute reduction between object and property oriented concept lattices
Knowledge-Based Systems
A new model of evaluating concept similarity
Knowledge-Based Systems
Information Sciences: an International Journal
Concept lattices of fuzzy contexts: Formal concept analysis vs. rough set theory
International Journal of Approximate Reasoning
Knowledge Reduction in Formal Contexts Based on Covering Rough Sets
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Granular Sets --- Foundations and Case Study of Tolerance Spaces
RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Granular Computing and Knowledge Reduction in Formal Contexts
IEEE Transactions on Knowledge and Data Engineering
Attribute selection with fuzzy decision reducts
Information Sciences: an International Journal
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
Covering Based Approaches to Rough Sets and Implication Lattices
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Fast Single-Link Clustering Method Based on Tolerance Rough Set Model
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
The investigation of the Bayesian rough set model
International Journal of Approximate Reasoning
Granular computing applied to ontologies
International Journal of Approximate Reasoning
Approaches to attribute reduction in concept lattices induced by axialities
Knowledge-Based Systems
Relation between concept lattice reduction and rough set reduction
Knowledge-Based Systems
Rough approximation operators in covering approximation spaces
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
Covering based rough set approximations
Information Sciences: an International Journal
International Journal of Approximate Reasoning
Hi-index | 0.00 |
This paper proposes an approach to attribute reduction in formal contexts via a covering rough set theory. The notions of reducible attributes and irreducible attributes of a formal context are first introduced and their properties are examined. Judgment theorems for determining all attribute reducts in the formal context are then obtained. According to the attribute reducts, all attributes of the formal context are further classified into three types and the characteristic of each type is characterized by the properties of irreducible classes of the formal context. Finally, by using the discernibility attribute sets, a method of distinguishing the reducible attributes and the irreducible attributes in formal contexts is presented.