Boolean Reasoning for Feature Extraction Problems
ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems
Variable Precision Rough Sets with Asymmetric Bounds
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Approaches to knowledge reduction based on variable precision rough set model
Information Sciences—Informatics and Computer Science: An International Journal - Mining stream data
Knowledge Acquisition Based on Rough Set Theory and Principal Component Analysis
IEEE Intelligent Systems
Performance Analysis of Accelerated Quickreduct Algorithm
ICCIMA '07 Proceedings of the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007) - Volume 02
Applications of Rough Sets in the Field of Data Mining
ICETET '08 Proceedings of the 2008 First International Conference on Emerging Trends in Engineering and Technology
Incremental learning in AttributeNets with dynamic reduct and IQuickReduct
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Scalable improved quick reduct: sample based
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
| Hi-index | 0.00 |
Most of the Rough Sets applications are involved in conditional reduct computations. Quick Reduct Algorithm (QRA) for reduct computation is most popular since its discovery. The QRA has been modified in this paper by sequential redundancy reduction approach. The performance of this new improved Quick Reduct (IQRA) is discussed in this paper.