Indicator space configuration for early warning of violent political conflicts by genetic algorithms

Annals of Operations Research

Volumn 97, Issue 1-4, 2000, Pages 287-311

  Ivanova, Petya I ^a   Tagarev, Todor D ^b  

^a INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

^b Faculty of Physics Sofia University St Kliment Ohridski   (Bulgaria)

Author keywords

Early warning; Genetic algorithms; Indicator selection; Neural networks; Pattern recognition

Indexed keywords

EID: 26444478657     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. H. Almuallim and T.G. Dietterich, Learning boolean concepts in the presence of many irrelevant features, Artificial Intelligence 69(1-2) (1994) 279-305.
2. J. Bala, J. Huang, H. Vafaie, K. De Jong and H. Wechsler, Hybrid learning using genetic algorithms and decision trees for pattern classification, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (Morgan Kaufmann, Montreal, Canada, 1995) pp. 719-724.
3. J. Bala, K. De Jong, J. Huang, H. Vafaie and H. Wechsler, Using learning to facilitate the evolution of features for recognizing visual concepts, Evolutionary Computation 4(3) (1996) 297-311.
4. M. Boddy and T. Dean, Deliberation scheduling for problem solving in time-constrained environment, Artificial Intelligence 67(2) (1994) 245-285.
5. G. Brassard and P. Bratley, Fundamentals of Algorithms (Prentice-Hall, NJ, 1996).
6. P. Brecke, Finding harbingers of violent conflict: Using pattern recognition to anticipate conflicts, in: Conflict Management and Peace Research (to appear).
7. P. Brecke, Using neural networks to find harbingers of violent conflicts, in: Preprints of the IFAC Conference on Supplemental Ways for Improving International Stability, Vienna, Austria (September 29-October 1, 1995) pp. 183-190.
8. S. Brown, The Causes and Prevention of War, 2nd ed. (St. Martin's Press, New York, 1994).
9. R. Caruana and D. Freitag, Greedy attribute selection, in: Proceedings of the 11th International Conference on Machine Learning (Morgan Kaufmann, New Brunswick, NJ, 1994) pp. 28-36.
10. M. Dash and H. Liu, Feature selection for classification, Intelligent Data Analysis 1(3) (1997).
11. M. Dash and H. Liu, Hybrid search of feature subsets, in: PRICAI'98 (1998) pp. 22-27.
12. S. Davies and S. Russell, NP-completeness of searches for smallest possible feature sets, in: Proceedings of the AAAI Fall Symposium on Relevance (AAAI Press, New Orleans, LA, 1994) pp. 37-39.
13. P. Devijver and J. Kittler, Pattern Recognition: A Statistical Approach (Prentice-Hall, Englewood Cliffs, NJ, 1982).
14. T.G. Dietterich, An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization, Machine Learning 3 (1998) 1-22.
15. N.R. Draper and H. Smith, Applied Regression Analysis, 2nd ed. (Wiley, 1981).
16. L. Eshelman, The CHC adaptive search algorithm. How to have safe search when engaging in nontraditional genetic recombination, in: FOGA-1, Vol. 9, ed. G. Rawlins (Morgan Kaufmann, 1991) pp. 265-283.
17. I. Foroutan and J. Sklansky, Feature selection for automatic classification of non-Gaussian data, IEEE Trans. Systems Man Cybernet. 17 (1987) 187-198.