Rough set algorithms in classification problem

By J. Bazan, H. Nguyen, S. H. Nguyen, P. Synak, J. Wróblewski. 2000

457 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/39619f285c1ef5ce05c7afa9a5d6d81dc5d1a3ae

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Witold Pedrycz
2. Richard Jensen
3. Vladik Kreinovich
4. Andrzej Skowron
5. Jie Yang
6. Zdzislaw Pawlak
7. Yiyu Yao
8. Y. Qian

In Computational Theory and Mathematics

1. Witold Pedrycz
2. Richard Jensen
3. Yiyu Yao
4. Vladik Kreinovich
5. Andrzej Skowron
6. Jie Yang
7. Zdzislaw Pawlak
8. Y. Qian

In Information Systems

1. Witold Pedrycz
2. Richard Jensen
3. Vladik Kreinovich
4. Andrzej Skowron
5. Zdzislaw Pawlak
6. Yiyu Yao
7. Y. Qian
8. Jiye Liang

Citations in the corpus

• Handbook of Granular Computing (2008, methodology): “More recent methods to compute verified ranges of functions can be found in [61, 62].”
• Attribute reduction in decision-theoretic rough set models (2008, unknown): “Different algorithms, approaches and methodologies have been extensively studied [1,36,2,4,11,13,17,20,29,35,41,51].”
• Rough sets and Boolean reasoning (2007, methodology): “A variety of methods for computing reducts and their applications can be found in [5,51,57,88,99,100,106,107,112,114, 117,118,135,136].”
• Feature selection based on rough sets and particle swarm optimization (2007, methodology): “It presents two deterministic algorithms for the computation of the whole reduct set, both algorithms compute the discernibility matrix for this purpose (Bazan et al, 2000).”