论文信息 - A New Discernibility Matrix and Function

A New Discernibility Matrix and Function

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

Houkuan Huang | Dayong Deng | Houkuan Huang | Dayong Deng

[1] XIAOHUA Hu,et al. LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH , 1995, Comput. Intell..

[2] Andrzej Skowron,et al. The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[3] Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[4] Marcin Szczuka,et al. Rough Sets in KDD , 2005 .

[5] Wang Guo. Calculation Methods for Core Attributes of Decision Table , 2003 .

[6] Chen Zhao-jiong,et al. A New Discernibility Matrix and the Computation of a Core , 2002 .

[7] Jan G. Bazan,et al. Rough set algorithms in classification problem , 2000 .