Skip to main content
Top

2011 | OriginalPaper | Chapter

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

Authors : Tshilidzi Marwala, Dr. Monica Lagazio

Published in: Militarized Conflict Modeling Using Computational Intelligence

Publisher: Springer London

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference Arumugam, M.S., Rao, M.V.C.: Molecular docking with multi-objective particle swarm optimization. Appl. Soft Comput. 8, 666–675 (2008)CrossRef Arumugam, M.S., Rao, M.V.C.: Molecular docking with multi-objective particle swarm optimization. Appl. Soft Comput. 8, 666–675 (2008)CrossRef
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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)CrossRef 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)CrossRef
go back to reference Brits, R., Engelbrecht, A.P., van den Bergh, F.: Locating multiple optima using particle swarm optimization. Appl. Math. and Comput. 189, 1859–1883 (2007)MathSciNetMATHCrossRef Brits, R., Engelbrecht, A.P., van den Bergh, F.: Locating multiple optima using particle swarm optimization. Appl. Math. and Comput. 189, 1859–1883 (2007)MathSciNetMATHCrossRef
go back to reference 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)MathSciNetMATHCrossRef 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)MathSciNetMATHCrossRef
go back to reference Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6, 58–73 (2002)CrossRef Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6, 58–73 (2002)CrossRef
go back to reference Crossingham, B.: Rough set partitioning using computational intelligence approach. M.Sc. thesis, University of the Witwatersrand (2007) Crossingham, B.: Rough set partitioning using computational intelligence approach. M.Sc. thesis, University of the Witwatersrand (2007)
go back to reference 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)CrossRef 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)CrossRef
go back to reference Crossingham, B., Marwala, T.: Using optimisation techniques to granulise rough set partitions. Comput. Models for Life Sci. 952, 248–257 (2007b) Crossingham, B., Marwala, T.: Using optimisation techniques to granulise rough set partitions. Comput. Models for Life Sci. 952, 248–257 (2007b)
go back to reference Crossingham, B., Marwala, T.: Using optimisation techniques for discretizing rough set partitions. Int. J. Hybrid Intell. Syst. 5, 219–236 (2008)MATH Crossingham, B., Marwala, T.: Using optimisation techniques for discretizing rough set partitions. Int. J. Hybrid Intell. Syst. 5, 219–236 (2008)MATH
go back to reference Dindar, Z.A.: Artificial neural networks applied to option pricing. Unpublished MSc thesis, University of the Witwatersrand (2004) Dindar, Z.A.: Artificial neural networks applied to option pricing. Unpublished MSc thesis, University of the Witwatersrand (2004)
go back to reference 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) 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)
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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) 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)
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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) 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)
go back to reference 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)MathSciNetMATHCrossRef 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)MathSciNetMATHCrossRef
go back to reference 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) 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)
go back to reference 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)MathSciNetMATHCrossRef 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)MathSciNetMATHCrossRef
go back to reference Janson, S., Merkle, D., Middendorf, M.: Strength design of composite beam using gradient and particle swarm optimization. Compos. Struct. 81, 471–479 (2007)CrossRef Janson, S., Merkle, D., Middendorf, M.: Strength design of composite beam using gradient and particle swarm optimization. Compos. Struct. 81, 471–479 (2007)CrossRef
go back to reference Jarboui, B., Damak, N., Siarry, P., Rebai, A.: The landscape adaptive particle swarm optimizer. Appl. Soft Comput. 8, 295–304 (2008)CrossRef Jarboui, B., Damak, N., Siarry, P., Rebai, A.: The landscape adaptive particle swarm optimizer. Appl. Soft Comput. 8, 295–304 (2008)CrossRef
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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) 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)
go back to reference Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001) Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)
go back to reference 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) 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)
go back to reference 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)MathSciNetMATHCrossRef 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)MathSciNetMATHCrossRef
go back to reference 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) 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)
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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)MathSciNetMATHCrossRef 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)MathSciNetMATHCrossRef
go back to reference 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) 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)
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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)CrossRef 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)CrossRef
go back to reference Marwala, T.: Finite element model updating using particle swarm optimization. Int. J. of Eng. Simul. 6, 25–30 (2005) Marwala, T.: Finite element model updating using particle swarm optimization. Int. J. of Eng. Simul. 6, 25–30 (2005)
go back to reference Marwala, T.: Computational Intelligence for Missing Data Imputation, Estimation and Management: Knowledge Optimization Techniques. IGI Global Publications, New York (2009)CrossRef Marwala, T.: Computational Intelligence for Missing Data Imputation, Estimation and Management: Knowledge Optimization Techniques. IGI Global Publications, New York (2009)CrossRef
go back to reference Marwala, T.: Finite Element Model Updating Using Computational Intelligence Techniques. Springer, London (2010)MATHCrossRef Marwala, T.: Finite Element Model Updating Using Computational Intelligence Techniques. Springer, London (2010)MATHCrossRef
go back to reference Marwala, T., Crossingham, B.: HIV status estimation using optimization, rough sets and demographic data. Current Sci. 95, 1123–1124 (2008) Marwala, T., Crossingham, B.: HIV status estimation using optimization, rough sets and demographic data. Current Sci. 95, 1123–1124 (2008)
go back to reference 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) 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)
go back to reference Mitchell, M., Holland, J., Forest, S.: When will a genetic algorithm outperform hill climbing? Adv. in Neural Info. Process Syst. 6, 51–58 (1994) Mitchell, M., Holland, J., Forest, S.: When will a genetic algorithm outperform hill climbing? Adv. in Neural Info. Process Syst. 6, 51–58 (1994)
go back to reference 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) 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)
go back to reference Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)MATH Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)MATH
go back to reference Poli, R.: An analysis of publications on particle swarm optimisation applications (Technical Report CSM-469). Department of Computer Science, University of Essex (2007) Poli, R.: An analysis of publications on particle swarm optimisation applications (Technical Report CSM-469). Department of Computer Science, University of Essex (2007)
go back to reference 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)MathSciNetCrossRef 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)MathSciNetCrossRef
go back to reference Ransome, T.: Automatic minimisation of patient setup errors in proton beam therapy. Unpublished MSc thesis, University of the Witwatersrand (2006) Ransome, T.: Automatic minimisation of patient setup errors in proton beam therapy. Unpublished MSc thesis, University of the Witwatersrand (2006)
go back to reference 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) 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)
go back to reference Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (2003) Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (2003)
go back to reference 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)MathSciNetCrossRef 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)MathSciNetCrossRef
go back to reference Sha, D.Y., Hsu, C.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. and Ind. Eng. 51, 791–808 (2006)CrossRef Sha, D.Y., Hsu, C.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. and Ind. Eng. 51, 791–808 (2006)CrossRef
go back to reference 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) 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)
go back to reference 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) 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)
go back to reference 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) 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)
go back to reference 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) 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)
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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) 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)
go back to reference 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) 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)
go back to reference 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) 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)
go back to reference 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)CrossRef 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)CrossRef
go back to reference Yisu, J., Knowles, J., Hongmei, L., Yizeng, L., Kell, D.B.: The landscape adaptive particle swarm optimizer. Appl. Soft Comput. 8, 295–304 (2008)CrossRef Yisu, J., Knowles, J., Hongmei, L., Yizeng, L., Kell, D.B.: The landscape adaptive particle swarm optimizer. Appl. Soft Comput. 8, 295–304 (2008)CrossRef
go back to reference 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) 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)
go back to reference 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) 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)
go back to reference 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) 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)
Metadata
Title
Particle Swarm Optimization and Hill-Climbing Optimized Rough Sets for Modeling Interstate Conflict
Authors
Tshilidzi Marwala
Dr. Monica Lagazio
Copyright Year
2011
Publisher
Springer London
DOI
https://doi.org/10.1007/978-0-85729-790-7_8

Premium Partner