Particle Swarm Optimization and Hill-Climbing Optimized Rough Sets for Modeling Interstate Conflict

Part of the Advanced Information and Knowledge Processing book series (AI&KP)


This chapter presents methods to optimally granulize rough set partition sizes using particle swarm optimization and hill climbing techniques. These two methods are then compared to the equal-width-bin partitioning technique. The results obtained demonstrated that hill climbing provides higher forecasting accuracy, followed by the particle swarm optimization method, which was better than the equal-width-bin technique.


Particle Swarm Optimization Hill Climbing Particle Swarm Optimization Method Standard Particle Swarm Optimization Partition Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Arumugam, M.S., Rao, M.V.C.: Molecular docking with multi-objective particle swarm optimization. Appl. Soft Comput. 8, 666–675 (2008)CrossRefGoogle Scholar
  2. Arya, L.D., Choube, S.C., Shrivastava, M., Kothari, D.P.: The design of neuro-fuzzy networks using particle swarm optimization and recursive singular value decomposition. Neurocomputing 71, 297–310 (2007)CrossRefGoogle Scholar
  3. Berlinet, A., Roland, C.: A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos, Solitons & Fractals 35, 851–861 (2008)CrossRefGoogle Scholar
  4. Brits, R., Engelbrecht, A.P., van den Bergh, F.: Locating multiple optima using particle swarm optimization. Appl. Math. and Comput. 189, 1859–1883 (2007)MathSciNetMATHCrossRefGoogle Scholar
  5. Cano, A., Gomez, M., Moral, S., Abellan, J.: Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks. Int. J. Approx. Reason. 44, 261–280 (2007)MathSciNetMATHCrossRefGoogle Scholar
  6. Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6, 58–73 (2002)CrossRefGoogle Scholar
  7. Crossingham, B.: Rough set partitioning using computational intelligence approach. M.Sc. thesis, University of the Witwatersrand (2007)Google Scholar
  8. Crossingham, B., Marwala, T.: Using genetic algorithms to optimise rough set partition sizes for HIV data analysis. Stud. in Comput. Intell. 78, 245–250 (2007a)CrossRefGoogle Scholar
  9. Crossingham, B., Marwala, T.: Using optimisation techniques to granulise rough set partitions. Comput. Models for Life Sci. 952, 248–257 (2007b)Google Scholar
  10. Crossingham, B., Marwala, T.: Using optimisation techniques for discretizing rough set partitions. Int. J. Hybrid Intell. Syst. 5, 219–236 (2008)MATHGoogle Scholar
  11. Dindar, Z.A.: Artificial neural networks applied to option pricing. Unpublished MSc thesis, University of the Witwatersrand (2004)Google Scholar
  12. Dindar, Z.A., Marwala, T.: Option pricing using a committee of neural networks and optimized networks. In: Proceedings of the 2004 IEEE International Conference on Systems, Man and Cybernetics, vol. 1, pp. 434–438. The Hague (2004)Google Scholar
  13. Du, H., Qi, J.: Application of a hybrid algorithm based on genetic algorithm and hill-climbing algorithm to tool path optimization in CNC machining. Adv. Mater. Res. 102, 681–685 (2010)CrossRefGoogle Scholar
  14. Filiberto, Y., Bello, R., Caballero, Y., Larrua, R.: Using PSO and RST to predict the resistant capacity of connections in composite structures. Stud. in Comput. Intell. 284, 359–370 (2010)CrossRefGoogle Scholar
  15. Garder, L.M., Hovin, M.E.: Robot gaits evolved by combining genetic algorithms and binary hill climbing. In: Proceedings of the 8th annual conference on Genetic and Evolutionary Computation, pp. 1165–1170. ACM, New York (2006)Google Scholar
  16. Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Oper. Res. 8, 487–503 (1960)MathSciNetMATHCrossRefGoogle Scholar
  17. Guerra, F.A., dos S Coelho, L.: A particle swarm optimization approach to nonlinear rational filter modeling. Expert. Syst. with Appl. 34, 1194–1199 (2008)CrossRefGoogle Scholar
  18. Heppner, F., Grenander, U.: A stochastic non-linear model for coordinated bird flocks. In: Krasner, S. (ed.) The Ubiquity of Chaos, 1st edn. AAAS Publications, Washington, DC (1990)Google Scholar
  19. Hernandez, D., Gras, R., Appel, R.: Neighborhood functions and hill-climbing strategies dedicated to the generalized ungapped local multiple alignment. Eur. J. Oper. Res. 185, 1276–1284 (2008)MathSciNetMATHCrossRefGoogle Scholar
  20. Iclanzan, D., Dumitrescu, D.: Overcoming hierarchical difficulty by hill-climbing the building block structure. In: Thierens, D et al. (eds.) GECCO 2007: Proceedings of the 9th annual conference on Genetic and Evolutionary Computation, vol. 2, pp. 1256–1263 ACM Press, London (2007)Google Scholar
  21. Jacobson, S.H., McLay, L.A., Hall, S.N., Henderson, D., Vaughan, D.E.: Optimal search strategies using simultaneous generalized hill climbing algorithms. Math. Comput. Model. 43, 1061–1073 (2006)MathSciNetMATHCrossRefGoogle Scholar
  22. Janson, S., Merkle, D., Middendorf, M.: Strength design of composite beam using gradient and particle swarm optimization. Compos. Struct. 81, 471–479 (2007)CrossRefGoogle Scholar
  23. Jarboui, B., Damak, N., Siarry, P., Rebai, A.: The landscape adaptive particle swarm optimizer. Appl. Soft Comput. 8, 295–304 (2008)CrossRefGoogle Scholar
  24. Jiang, Y., Hu, T., Huang, C., Wu, X.: Particle swarm optimization based on dynamic niche technology with applications to conceptual design. Adv. Eng. Soft. 38, 668–676 (2007)CrossRefGoogle Scholar
  25. Kathiravan, R., Ganguli, R.: Particle swarm optimization for determining shortest distance to voltage collapse. Int. J. of Electr. Power & Energy Systems 29, 796–802 (2007)CrossRefGoogle Scholar
  26. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE Service Center, Piscataway (1995)Google Scholar
  27. Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)Google Scholar
  28. Khor, S.: Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution. GECCO, Proceedings of the 9th annual conference on Genetic and Evolutionary Computation, pp. 277–284. ACM, New York (2007)Google Scholar
  29. Lewis, R.: A general-purpose hill-climbing method for order independent minimum grouping problems: a case study in graph colouring and bin packing. Comput. & Oper. Res. 36, 2295–2310 (2009)MathSciNetMATHCrossRefGoogle Scholar
  30. Li, Y., Zhang, X.-L.: PSO-based method for learning similarity measure of nominal features. In: Proceedings of the International Conference on Machine Learning and Cybernetics, pp. 1868–1874 (2010)Google Scholar
  31. Lian, Z., Gu, X., Jiao, B.: Multi-step ahead nonlinear identification of Lorenz’s Chaotic system using radial basis neural network with learning by clustering and particle swarm optimization. Chaos, Solitons & Fractals 35, 967–979 (2008)CrossRefGoogle Scholar
  32. Lim, A., Lin, J., Rodrigues, B., Xiao, F.: Ant colony optimization with hill climbing for the bandwidth minimization problem. Appl. Soft Comput. 6, 180–188 (2006a)CrossRefGoogle Scholar
  33. Lim, A., Rodrigues, B., Zhang, X.: A simulated annealing and hill-climbing algorithm for the traveling tournament problem. Eur. J. Oper. Res. 174, 1459–1478 (2006b)MathSciNetMATHCrossRefGoogle Scholar
  34. Lin, W., Wu, Y., Mao, D., Yu, Y.: Attribute reduction of rough set based on particle swarm optimization with immunity. In: Proceedings of the 2nd International Conference on Genetic and Evolutionary Computation, pp. 14–17 (2008)Google Scholar
  35. Lin, Y., Chang, W., Hsieh, J.: Application of multi-phase particle swarm optimization technique to inverse radiation problem. J. Quant. Spectrosc. and Radiat. Transf. 109, 476–493 (2008b)CrossRefGoogle Scholar
  36. Liu, X., Liu, H., Duan, H.: Time series prediction with recurrent neural networks trained by a hybrid PSO–EA algorithm. Neurocomputing 70, 2342–2353 (2007)CrossRefGoogle Scholar
  37. Marwala, T.: Finite element model updating using particle swarm optimization. Int. J. of Eng. Simul. 6, 25–30 (2005)Google Scholar
  38. Marwala, T.: Computational Intelligence for Missing Data Imputation, Estimation and Management: Knowledge Optimization Techniques. IGI Global Publications, New York (2009)CrossRefGoogle Scholar
  39. Marwala, T.: Finite Element Model Updating Using Computational Intelligence Techniques. Springer, London (2010)MATHCrossRefGoogle Scholar
  40. Marwala, T., Crossingham, B.: HIV status estimation using optimization, rough sets and demographic data. Current Sci. 95, 1123–1124 (2008)Google Scholar
  41. Miao, A., Shi, X., Zhang, J., Jiang, W., Zhang, J., Gui, X.: Dynamic particle swarm optimization based on neighborhood rough set model. In: Proceedings of the 2nd International Asia Conference on Informatics in Control, Automation and Robotics, pp. 95–100 (2010)Google Scholar
  42. Mitchell, M., Holland, J., Forest, S.: When will a genetic algorithm outperform hill climbing? Adv. in Neural Info. Process Syst. 6, 51–58 (1994)Google Scholar
  43. Mpanza, L.J., Marwala, T.: Rough set theory for HV bushings fault detection: tradeoff between accuracy and transparency. In: Proceedings of the 3rd International Conference on Machine Learning and Computing, vol. 2, pp. 121–125. Singapore (2011)Google Scholar
  44. Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)MATHGoogle Scholar
  45. Poli, R.: An analysis of publications on particle swarm optimisation applications (Technical Report CSM-469). Department of Computer Science, University of Essex (2007)Google Scholar
  46. Qi, H., Ruan, L.M., Shi, M., An, W., Tan, H.P.: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl. Math. and Comput. 195, 299–308 (2008)MathSciNetCrossRefGoogle Scholar
  47. Ransome, T.: Automatic minimisation of patient setup errors in proton beam therapy. Unpublished MSc thesis, University of the Witwatersrand (2006)Google Scholar
  48. Ransome, T.M., Rubin, D.M., Marwala, T., de Kok, E.A.: Optimising the verification of patient positioning in proton beam therapy. In: Proceedings of the IEEE 3rd International Conference on Computation Cybernetics, pp. 279–284 (2005)Google Scholar
  49. Reynolds, C.W.: Flocks, herds and schools: a distributed behavioral model. Comp. Graphics 2, 25–34 (1987)MathSciNetCrossRefGoogle Scholar
  50. Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (2003)Google Scholar
  51. Santos, O., Sanchez-Diaz, G.: Suboptimal control based on hill-climbing method for time delay systems. IET Contr. Theory and Appl. 1, 1441–1450 (2007)MathSciNetCrossRefGoogle Scholar
  52. Sha, D.Y., Hsu, C.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. and Ind. Eng. 51, 791–808 (2006)CrossRefGoogle Scholar
  53. Sheldakova, J., Rukosuev, A., Romanov, P., Kudryashov, A., Samarkin, V.: Hill-climbing algorithm for adaptive optical system with Shack-Hartmann sensor. In: Proceedings of the 5th International Conference on Advanced Optoelectronics and Lasers, pp. 157–158 (2010)Google Scholar
  54. Shen, H., Yang, S., Liu, J.: An attribute reduction of rough set based on PSO. In: Rough set and knowledge technology. 5th international conference, RSKT 2010, Beijing, China, October 15–17, 2010. Proceedings Lecture Notes in Computer Science, vol. 6401, pp. 695–702. Springer (ISBN 978-3-642-16247-3), Berlin (2010)Google Scholar
  55. Shi, Y., Eberhart, R.C.: Parameter selection in particle swarm optimization. In: Proceedings of the 7th International Conference on Evolutionary Programming VII, pp. 591–600. Springer-Verlag, London (1998)Google Scholar
  56. Tettey, T., Nelwamondo, F.V., Marwala, T.: HIV data analysis via rule extraction using rough sets. In: Proceedings of the 11th IEEE International Conference on Intelligent Engineering Systems, vol. 29, pp. 105–110, Budapest (2007)Google Scholar
  57. Vo, T.Q., Kim, H.S., Lee, B.R.: Propulsive velocity optimization of 3-joint fish robot using genetic-hill climbing algorithm. J. of Bionic. Eng. 6, 415–429 (2009)CrossRefGoogle Scholar
  58. Wang, Q., Gao, Y., Liu, P.: Hill climbing-based decentralized job scheduling on computational grids. In: Proceedings of the First International Multi-Symposiums on Computer and Computational Science, vol. 1, pp. 705–708. IEEE Computer Society, Washington, DC (2006)Google Scholar
  59. Wang, X., Wan, W., Yu, X.: Rough set approximate entropy reducts with order based particle swarm optimization. In: Proc of the 1st ACM//SIGEVO Summit on Genetic and Evol Comput: 553–559 (2009)Google Scholar
  60. Xu, L., Dong, W., Wang, J., Gu, S.: A method of the knowledge acquisition using rough set knowledge reduction algorithm based on PSO. In: Proceedings of the World Congress on Intelligence Control and Automation, pp. 5317–5320 (2008)Google Scholar
  61. Yildiz, A.R.: An effective hybrid immune-hill climbing optimization approach for solving design and manufacturing optimization problems in industry. J. Mater. Process Technol. 209, 2773–2780 (2009)CrossRefGoogle Scholar
  62. Yisu, J., Knowles, J., Hongmei, L., Yizeng, L., Kell, D.B.: The landscape adaptive particle swarm optimizer. Appl. Soft Comput. 8, 295–304 (2008)CrossRefGoogle Scholar
  63. Yu, Y., Wang, J., Zhu, J.: Method for intelligent decision making based on rough sets and particle swarm optimization. In: Proceedings of the 2010 2nd International Conference on Computer Modelling and Simulation, vol. 4, pp. 230–233. IEEE Computer Society, Washington, DC (2010) Google Scholar
  64. Zhao, Y.: A complete algorithm for attribute reduction in rough set based on particle swarm optimization. In: Proceedings of the 2009 2nd International Conference on Intelligent Computation Technology and Automation, vol. 1, pp. 215–218. IEEE Computer Society Washington, DC (2009)Google Scholar
  65. Zhao, Q., Zhao, J., Meng, G., Liu, L.: A new method of data mining based on rough sets and discrete particle swarm optimization. In: Proceedings of the International Conference on Computer Engineering and Technology, pp. 2424–2430 (2010)Google Scholar

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.University of JohannesburgJohannesburgSouth Africa

Personalised recommendations