Communications of the ACM
The economics of information security investment
ACM Transactions on Information and System Security (TISSEC)
The particle swarm optimization algorithm: convergence analysis and parameter selection
Information Processing Letters
Why Information Security is Hard-An Economic Perspective
ACSAC '01 Proceedings of the 17th Annual Computer Security Applications Conference
Decision Support Systems - Special issue: Intelligence and security informatics
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Organizations are determining the optimal amount to invest to protect a given set of information system from the threat presented by vulnerabilities. The decisions concerning information security investment is a multi-objective problem and it is NP-hard to solve exactly. The objective of this article is to present and evaluate an improved binary particle swarm optimization (PSO)-based approach enabling organizations to choose the minimal-cost security investment schemes with the maximal vulnerability coverage. To speed up the convergence, the memory mechanism is implanted in the traditional binary PSO algorithm. After experiment, the proposed algorithm has demonstrated higher searching efficiency and better stability than the genetic algorithms mentioned in other literatures. The PSO-based approach provides favorable results and a simple tool for supporting information security investment decisions making.