A swarm intelligence algorithm based game theory Online publication date: Sat, 10-May-2014
by Yan-ping Bai; Yu Zhang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 3, 2013
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com