The Extension-Based Ant Colony Optimization of Finding Rough Set Reducts

摘要

Ant colony algorithm is a simulated evolutionary algorithm, which shows many excellent characters and has succeeded in solving many difficult combinatorial optimization problems. However, it is not perfect now. Inspired by dependent function of extension theory, a new statue transition rule and local updating rule based on dependent function have been presented in this paper. And experimental results show that our algorithm is effective and useful.