A new discernibility matrix and function

Authors:
Dayong Deng;Houkuan Huang
Affiliations:
School of Computer and Information Technology, Beijing Jiaotong University, Beijing, P.R.China;School of Computer and Information Technology, Beijing Jiaotong University, Beijing, P.R.China
Venue:
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Year:
2006

Citing 2
Cited 3

Rough set algorithms in classification problem

Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

Research on rough set theory and applications in China

Transactions on rough sets VIII
Parallel reducts based on attribute significance

RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Classification and decision based on parallel reducts and f-rough sets

RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, we define a new discernibility matrix and function between two decision tables. They are extension of Hu's improved discernibility matrix and function such that the reducts and the cores of decision tables could be calculated by parts of them. The method of new discernibility matrix and function may be applied to the cases of large amount of data and incremental data