On population diversity measures in Euclidean space

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Lacevic, Bakir ^a   Amaldi, Edoardo ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIVERSITY MEASURE; EUCLIDEAN MINIMUM SPANNING TREES; EUCLIDEAN SPACES; MATHEMATICAL NOTION; POINT COLLOCATION; POPULATION DIVERSITY; STRUCTURED POPULATION; UNIFORM DISTRIBUTION;

ARTIFICIAL INTELLIGENCE; PLANT EXTRACTS;

COMPUTATIONAL COMPLEXITY;

EID: 79959518695     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586498     Document Type: Conference Paper

References (40)

1. R. K. Ursem, "Diversity-Guided Evolutionary Algorithms", Proc. Int. Conf. on Parallel Problem Solving from Nature, 2002, pp 462-474.
2. H. Shimodaira, "A Diversity Control Oriented Genetic Algorithm (DCGA): Development and Experimental Results", Proc. Conf. Gen. and Evol. Comput. , 1999, pp 603-611.
3. H. Ben Amor, A. Rettinger, "Intelligent exploration for genetic algorithms: using self-organizing maps in evolutionary computation", Proc. Conf. Gen. and Evol. Comput., 2005, pp 1531-1538.
4. R. Myers, R. Hancock, "Genetic algorithms for ambiguous labeling problems", Pattern Recogn. 33(4): 2000, pp 685-704.
5. M.A. Bedau, M. Zwick, A. Bahm, "Variance and Uncertainty Measures of Population Diversity Dynamics", Advances in Systems Science and Applications Special Issue I, 1995, pp 7-12.
6. A. L. Barker, W. N. Martin, "Dynamics of a distance-based population diversity measure", Proc. IEEE Congr. Evol. Comput., 2000, pp 1002-1009.
7. K. Q. Zhu and Z. Liu, "Population Diversity in Permutation-Based Genetic Algorithm", Proc. European Conf. Mach. Learn., 2004, pp 537-547.
8. E. Zitzler, Evolutionary algorithms for multiobjective optimization: Methods and applications, Ph.D. dissertation, Swiss Federal Institute of Technology (ETH) Zurich, Switzerland, 1999.
9. M. Fleischer, "The Measure of Pareto Optima: Applications to Multiobjective Metaheuristics", Technical Report CSHCN TR 2002-17 (ISR TR 2002-32), Institute for Systems Research, University of Maryland, College Park.
10. L. While , P. Hingston, L. Barone and S. Huband, "A Faster Algorithm for Calculating Hypervolume", IEEE Trans. Evol. Comput., vol. 10, no.1, pp 29-38.
11. E. K. Burke, S. Gustafson, G. Kendall, "Diversity in Genetic Programming: An Analysis of Measures and Correlation with Fitness", IEEE Trans. Evol. Comput., 2004, v8, n1, pp 47-62.
12. P. A. N. Bosman, D. Thierens, "The balance between proximity and diversity in multiobjective evolutionary algorithms", IEEE Trans. Evol. Comput. v7, n2, 2003, pp 174-188.
13. R. W. Morrison, K. A. Jong, "Measurement of Population Diversity", Selected Papers From the 5th European Conference on Artificial Evolution, Lecture Notes In Computer Science, 2001, vol. 2310. Springer-Verlag, London, pp 31-41.
14. F. Oppacher, M. Wineberg, "The Underlying Similarity of Diversity Measures Used in Evolutionary Computation", Proc. Genetic and Evol. Comput. Conf., 2003, pp 1493-1504.
15. F. Oppacher, M. Wineberg, "A Linear Time Algorithm for Determining Population Diversity in Evolutionary Computation", Proc. of ISC 2003, Intelligent Systems and Control, 2003.
16. C. Mattiussi, M. Waibel, D. Floreano, Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes, Evol. Comput., 2004, MIT Press, vol. 12, no. 4, pp 495-515.
17. J. Riget, J. S. Vesterstroem, "A diversity-guided particle swarm optimizer - the ARPSO", Technical Report No. 2002-02, 2002, Dept. of Computer Science, University of Aarhus, EVALife.
18. J. Jie, J, Zeng, "Particle Swarm Optimization with Diversity-Controlled Acceleration Coefficients", Proc. 3rd Int. Conf. on Natural Comput., ICNC 2007, 2007, pp 150-154.
19. Y. Shi, R.C. Eberhart, "Population diversity of particle swarms", Proc. IEEE Congr. Evol. Comput., 2008, pp 1063-1067.
20. M. Blackwell, "Particle swarms and population diversity", Soft Comput. 2005, 9, 11, pp 793-802.
21. F. J. Hickernell, "A generalized discrepancy and quadrature error bound", Math. Comput. 1998, 67, 221, pp 299-322.
22. 2-discrepancy", J. Comput. Appl. Math., 2006, 189 (1-2), pp 341-361.
23. 2-discrepancies and construction of uniform designs by threshold accepting", J. Complexity, 2003, 19, pp 692-711.
24. Y.W. Leung and Y.P. Wang, "U-Measure: A quality measure for multiobjective programming", IEEE Trans. Syst. Man Cybern, part A, 2003, vol. 33, no. 3, pp 337-343.
25. H. Zouari, L. Heutte, Y. Lecourtier, "Controlling the diversity in classifier ensembles through a measure of agreement", Pattern Recogn., 2005 38(11), pp 2195-2199.
26. L. I. Kuncheva, C. J. Whitaker, "Measures of Diversity in Classifier Ensembles and Their Relationship with the Ensemble Accuracy", Mach. Learn. 2003, 51, 2, pp 181-207.
27. E. K. Tang, P. N. Suganthan, X. Yao, "An analysis of diversity measures". Mach. Learn., 65(1), 2006, pp 247-271.
28. L. M. Weitzman, On Diversity, Quarterly Journal of Economics 107, 1992, pp 363-406.
29. L. Xiangdong, L. Yuanchang, "Information Entropy Measures for Stand Structural Diversity: Joint Entropy", Forestry Studies In China, 2004, vol 6, no 2, pp 12-15.
30. A. E. Magurran, Ecological Diversity and Its Measurement, Princeton, NJ: Princeton University Press, 1988
31. B. Lacevic, S. Konjicija, Z. Avdagic, "Population diversity measure based on singular values of the distance matrix", Proc. IEEE Congr. Evol. Comp., 2007, pp 1863-1869.
32. G. H. Golub, C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, 1996.
33. S. Lee, Z. L. Zhang, S. Sahu, D. Saha, M. Srinivasan, "Fundamental Effects of Clustering on the Euclidean Embedding of Internet Hosts", Proc. IFIP Netw. Conf., 2007, pp 890-901.
34. V. Klee, "Can the measure of be computed in less than O(n log n) steps?" Amer. Math. Monthly, 1977, 84(4), pp 284-285.
35. M. Overmars, C.K. Yap, "New upper bounds in Klee's measure problem", SIAM J. Comput. 20, 1991, pp 1034-1045.
36. N. Beume and G. Rudolph, "Faster s-metric calculation by considering dominated hypervolume as Klee's measure problem", Technical Report CI 216/06, University of Dortmund, 2006.
37. B. Chazelle, "A minimum spanning tree algorithm with inverse- Ackermann type complexity", J. ACM, 2000, 47, 6, pp 1028-1047.
38. A. Yao, "On constructing minimum spanning trees in k-dimensional spaces and related problems", SIAM J. Comput., 1982, 11(4), pp 721-736.
39. C. F. Bazlamacci, K. S. Hindi, "Minimum-weight spanning tree algorithms: a survey and empirical study", Computers and Operations Research, 2001, 28, 8, pp 767-785.
40. B. Lacevic, E. Amaldi "On Population Diversity Measures", Technical Report 2009.17, Politecnico di Milano, 2009, available at http://home.dei.polimi.it/amaldi/ectropy-DEI-TReport-2009-17.pdf