By Topic

An algorithm for sub-optimal attribute reduction in decision table based on neighborhood rough set model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Max Z. -R. Liu ; School of Computer Engineering and Science, Shanghai University, China ; G. -F. Wu ; Z. -Q. Yu

In this paper, some concepts of upper approximation and lower approximation and so on are defined concisely and strictly on neighborhood rough set model. According to the fruit fly optimization algorithm's idea, an new algorithm(NBH SFR) to get a sub-optimal attribute reduction on neighborhood decision table is proposed. The validity and feasibility of the algorithm are demonstrated by the results of experiments on four UCI Machine Learning database. A detailed analysis of δ operator to influence on the results is given. And the δ operator formula to obtain a sub-optimal reduction is proposed. Moreover, the experiments also show that it is impossible to solve multi-dimensional big dataset based on kernel-based heuristic algorithm ideas.

Published in:

Intelligent Control and Automation (WCICA), 2012 10th World Congress on

Date of Conference:

6-8 July 2012