Abstract
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. © 2009 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Sai Prasad, P. S. V. S., & Rao, C. R. (2009). IQuickReduct: An improvement to quick reduct algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5908 LNAI, pp. 152–159). https://doi.org/10.1007/978-3-642-10646-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
