摘要

In this paper, we established a relationship between particle swarm optimisation algorithms and game theory. On that basis, a swarm intelligence-based search mechanism is proposed and applied to solving the attribute reduction problem in the context of rough sets. The proposed attribute reduction algorithm can set up different participatory groups and game strategies, construct corresponding pay utility matrix, and produce optimal combinations through gaming procedure. Numerical experiments on a number of UCI datasets show the proposed game strategies-based reduction algorithm is superior to particle swarm optimisation, tabu search, gene algorithm and PSO with mutation operator in terms of solution quality, and has lower computational cost.

全文