%0 Journal Article
%T An Innovative Approach for Attribute Reduction in Rough Set Theory
%A Alex Sandro Aguiar Pessoa
%A Stephan Stephany
%J Intelligent Information Management
%P 223-239
%@ 2160-5920
%D 2014
%I Scientific Research Publishing
%R 10.4236/iim.2014.65022
%X <p style=\"text-align:justify;\">
	<span style=\"font-size:10.0pt;font-family:;\" \"=\"\"><span style=\"font-family:Verdana;\">The Rough Sets
Theory is used in data mining with emphasis on the treatment of uncertain or vague
information. In the case of classification, this theory implicitly calculates
reducts of the full set of attributes, eliminating those that are redundant or
meaningless. Such reducts may even serve as input to other classifiers other
than Rough Sets. The typical high dimensionality of current databases precludes
the use of greedy methods to find optimal or suboptimal reducts in the search
space and requires the use of stochastic methods. In this context, the
calculation of reducts is typically performed by a genetic algorithm, but other
metaheuristics have been proposed with better performance. This work proposes
the innovative use of two known metaheuristics for this calculation, the
Variable Neighborhood Search, the Variable Neighborhood Descent, besides a
third heuristic called Decrescent Cardinality Search. The last one is a new
heuristic specifically proposed for reduct calculation. Considering some
databases commonly found in the literature of the </span><span><span style=\"font-family:Verdana;\">area, the reducts that have been obtained present lower cardinality,</span><i><span style=\"font-family:Verdana;\"> i.e.</span></i><span style=\"font-family:Verdana;\">,</span><i> </i><span style=\"font-family:Verdana;\">a lower number of</span></span><span style=\"font-family:Verdana;\"> attributes. </span></span> 
</p>
%K Rough Set Theory
%K Reducts
%K Attribute Reduction
%K Metaheuristics
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=49215