Abstract
Knowledge reduction of rough set theory is one of important research. It is a NP-hard problem to solve the optimal reduction in Information systems. According to the condition that any two objects can't be distinguish in information system, and according to the ideas of Fruit Fly Optimization Algorithm, an new optimization algorithm on knowledge reduction is proposed. Analyzes through the experiment show that this algorithm is feasible. Moreover, the experiments also show that the new algorithm can solve some problems that the algorithm based on heuristic can't solve.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call