The relationship among several knowledge reduction approaches

Authors:
Keyun Qin;Zheng Pei;Weifeng Du
Affiliations:
Department of Applied Mathematics, Southwest Jiaotong University, Chengdu, Sichuan, China;College of Computers & Mathematical-Physical Science, Xihua University, Chengdu, Sichuan, China;Department of Applied Mathematics, Southwest Jiaotong University, Chengdu, Sichuan, China
Venue:
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Year:
2005

Citing 3
Cited 4

&agr;-RST: a generalization of rough set theory

Information Sciences—Informatics and Computer Science: An International Journal
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Approaches to knowledge reduction based on variable precision rough set model

Information Sciences—Informatics and Computer Science: An International Journal - Mining stream data

Properties of the Second Type of Covering-Based Rough Sets

WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Research on rough set theory and applications in China

Transactions on rough sets VIII
Binary relation based rough sets

FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
The fourth type of covering-based rough sets

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is devoted to the discussion of the relationship among some reduction approaches of information systems. It is proved that the distribution reduction and the entropy reduction are equivalent, and each distribute reduction is a d reduction. Furthermore, for consistent information systems, the distribution reduction, entropy reduction, maximum distribution reduction, distribute reduction, approximate reduction and d reduction are all equivalent.