Application of granular computing in knowledge reduction

Authors:
Lai Wei;Duoqian Miao
Affiliations:
Department of Computer Science and Technology, Tongji University, Shanghai, P.R. China;Department of Computer Science and Technology, Tongji University, Shanghai, P.R. China
Venue:
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Year:
2006

Citing 3
Cited 1

Partition testing, stratified sampling, and cluster analysis

SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Knowledge discovery

Communications of the ACM
Knowledge discovery for decision support in law

ICIS '00 Proceedings of the twenty first international conference on Information systems

Research on rough set theory and applications in China

Transactions on rough sets VIII

Quantified Score

Hi-index	0.00

Visualization

Abstract

Skowron's discernibility matrix is one of representative approaches in computing relative core and relative reducts, while redundant information is also involved. To decrease the complexity of computation, the idea of granular computing is applied to lower the rank of discernibility matrix. In addition, the absorptivity based on bit-vector computation is proposed to simplify computation of relative core and relative reducts