Attribute reduction based on the extension concept lattice

Authors:
Hong Wang;Ran Gao
Affiliations:
Faculty of Science, Zhongyuan University of Technology, Zhengzhou, P.R. China;Faculty of Science, Zhongyuan University of Technology, Zhengzhou, P.R. China
Venue:
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Year:
2010

Citing 6
Cited 0

Rough concept analysis: a synthesis of rough sets and formal concept analysis

Fundamenta Informaticae - Special issue: rough sets
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 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 Rough Concept Analysis

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Approximate Reducts and Association Rules - Correspondence and Complexity Results

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the attribute-extent and the object-intent, define two pairs of conjugate pair approximation operators in a formal context, and discuss their operational properties. According to two kinds of concepts formed by the conjugate pair operators, introduce respectively the definitions of an extension concept lattice and an intension concept lattice At the same time, study the attribute reduction of an extension and intension concept lattice, The judgement theorem and discernibility matrix associated with formal context reduct are established, from which we can provide the approach to knowledge reduction in formal context.