Abstract:

As for the ant colony algorithm for attribute reduction which has the problems such as many iterationss, slow convergence obtaining no smallest reductions, this paper proposes the quantum ant colony for rough set attribute reduction. Each ant carries a group of ants which represent the current location information of quantum bits, uses  quantum revolving doors to complete the ant movement,and uses quantum gates to realize the nonant variation of the location. The experiments show that the algorithm can quickly and efficiently solve attribute reduction, and find the smallest reduction. It not only can get the smallest reduction attribute set, but also get a lot of reduction attribute set.

Key words: attribute reduction, rough set, quantum ant colony, ant colony algorithm