Extensions to IQuickReduct

Abstract

IQuickReduct algorithm is an improvement over a poplar reduct computing algorithm known as QuickReduct algorithm. IQuickReduct algorithm uses variable precision rough set (VPRS) calculations as a heuristic for determining the attribute importance for selection into reduct set to resolve ambiguous situations in Quick Reduct algorithm. An apt heuristic for selecting an attribute helps in producing shorter non redundant reducts. This paper explores the selection of input attribute in ambiguous situations by adopting several heuristic approaches instead of VPRS heuristic. Extensive experimentation has been carried out on the standard datasets and the results are analyzed. © 2011 Springer-Verlag.