A New Discernibility Matrix and Function-Reference-Cited by-同舟云学术

A New Discernibility Matrix and Function

Published:2006 Issue: Volume: Page:114-121
ISSN:0302-9743
Container-title:Rough Sets and Knowledge Technology
language:
Short-container-title:

Author:

Deng Dayong,Huang Houkuan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11795131_17.pdf

Reference9 articles.

1. Pawlak, Z.: Rough sets-Theoretical Aspect of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

2. Skowron, A.: Rough Sets in KDD. In: Special Invited Speaking, WCC2000 in Beijing (August 2000)

3. Bazan, G.J.: A Comparison of Dynamic Non-dynamic Rough Set Methods for Extracting Laws from Decision Tables. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1:Methodology and Applications, pp. 321–365. Physica-Verlag, Heidelberg (1998)

4. Bazan, G.J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications, pp. 49–88. Physica-Verlag (2000)

5. Liu, Q.: Rough Sets and Rough Reasoning (in Chinese). Science Press (2001)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Binary classification rule generation from decomposed data;International Journal of Intelligent Systems;2019-09-23

2. Horizontal decomposition of data table for finding one reduct;International Journal of General Systems;2017-12-15

3. Generalized attribute reduct in rough set theory;Knowledge-Based Systems;2016-01

4. Scalability of Data Decomposition Based Algorithms: Attribute Reduction Problem;Lecture Notes in Computer Science;2015

5. Attribute reduction: a horizontal data decomposition approach;Soft Computing;2014-12-21