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
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Sequential Association Rule Mining with Time Lags
Journal of Intelligent Information Systems
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
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
Hi-index | 0.01 |
Formal concept analysis is an important approach of knowledge representation and data analysis. This paper focus on the dependence among formal contexts with common object set. A partial order relation among formal contexts is first introduced and its properties are examined. Subsequently, The notion of independence of a formal context is proposed by which attribute reduction of formal context is investigated. An useful conclusion is obtained, that is, all formal contexts with common object set form a lattice.