Extensions to IQuickReduct

dc.contributor.author	Sai Prasad, P. S.V.S.
dc.contributor.author	Raghavendra Rao, Chillarige
dc.date.accessioned	2022-03-27T05:59:49Z
dc.date.available	2022-03-27T05:59:49Z
dc.date.issued	2011-12-26
dc.description.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.
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). v.7080 LNAI
dc.identifier.issn	03029743
dc.identifier.uri	10.1007/978-3-642-25725-4_31
dc.identifier.uri	http://link.springer.com/10.1007/978-3-642-25725-4_31
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/9050
dc.subject	Feature Selection
dc.subject	IQuickReduct
dc.subject	Quick Reduct
dc.subject	Reduct
dc.subject	Rough Sets
dc.title	Extensions to IQuickReduct
dc.type	Book Series. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1