Rough concept analysis: a synthesis of rough sets and formal concept analysis
Fundamenta Informaticae - Special issue: rough sets
Construction of the L-fuzzy concept lattice
Fuzzy Sets and Systems
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
A Triadic Approach to Formal Concept Analysis
ICCS '95 Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory
A Logical Generalization of Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Generalized Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
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
A Conceptual View of Knowledge Bases in Rough Set Theory
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Formal concept analysis for general objects
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Maximal consistent block technique for rule acquisition in incomplete information systems
Information Sciences: an International Journal
Sequential Association Rule Mining with Time Lags
Journal of Intelligent Information Systems
Approaches to knowledge reduction based on variable precision rough set model
Information Sciences—Informatics and Computer Science: An International Journal - Mining stream data
A multi-level conceptual data reduction approach based on the Lukasiewicz implication
Information Sciences: an International Journal - Special issue: Information technology
Monotone concepts for formal concept analysis
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Galois Connections and Data Analysis
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Reduction method for concept lattices based on rough set theory and its application
Computers & Mathematics with Applications
Mixed feature selection based on granulation and approximation
Knowledge-Based Systems
Relations of attribute reduction between object and property oriented concept lattices
Knowledge-Based Systems
An algorithm of constructing concept lattices for CAT with cognitive diagnosis
Knowledge-Based Systems
Real formal concept analysis based on grey-rough set theory
Knowledge-Based Systems
Granular Computing and Knowledge Reduction in Formal Contexts
IEEE Transactions on Knowledge and Data Engineering
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
Information Sciences: an International Journal
A rough set approach to feature selection based on power set tree
Knowledge-Based Systems
Knowledge reduction in decision formal contexts
Knowledge-Based Systems
A vague-rough set approach for uncertain knowledge acquisition
Knowledge-Based Systems
A novel attribute reduction approach based on the object oriented concept lattice
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Research on domain ontology in different granulations based on concept lattice
Knowledge-Based Systems
Graded rough set model based on two universes and its properties
Knowledge-Based Systems
Attribute Reduction in Formal Contexts: A Covering Rough Set Approach
Fundamenta Informaticae - Knowledge Technology
On interval type-2 rough fuzzy sets
Knowledge-Based Systems
International Journal of Approximate Reasoning
Rough set model based on formal concept analysis
Information Sciences: an International Journal
On galois connections and soft computing
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
Hi-index | 0.00 |
This paper investigates approaches to attribute reduction in concept lattices induced by axialities. Based on an axiality, a type of covariant Galois connection between power sets, or equivalently a binary relation between the ground sets, the lattice of all concepts associated with a formal context is studied. Some judgment theorems for attribute reduction in such a lattice are proposed and proved. Extended from the idea of knowledge reduction in rough set theory, a Boolean approach to calculating all reducts of a context is formulated via the use of discernibility function. Finally, all attributes are classified into three types by their significance in constructing the concept lattice. The characteristics of these types of attributes are also analyzed.