Ectropy of diversity measures for populations in Euclidean space
From MaRDI portal
Publication:545352
DOI10.1016/j.ins.2010.12.004zbMath1215.62004OpenAlexW2034513222MaRDI QIDQ545352
Publication date: 22 June 2011
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.12.004
Related Items
Diverse partitions of colored points ⋮ Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index ⋮ A diversity metric for population-based metaheuristic algorithms ⋮ Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities ⋮ A fast minimum spanning tree algorithm based on \(K\)-means ⋮ Enhanced particle swarm optimization based on principal component analysis and line search ⋮ Ectropy of diversity measures for populations in Euclidean space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ectropy of diversity measures for populations in Euclidean space
- Particle swarms and population diversity
- Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy
- An analysis of diversity measures
- A diversity maintaining population-based incremental learning algorithm
- Clustering to minimize the maximum intercluster distance
- Covering a set of points in multidimensional space
- On the \(L_2\)-discrepancy for anchored boxes
- Renyi's entropy as an index of diversity in simple-stage cluster sampling
- Wrap-around \(L_2\)-discrepancy of random sampling Latin hypercube and uniform designs
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy
- Lower bounds for centered and wrap-around \(L_2\)-discrepancies and construction of uniform designs by threshold accepting.
- A note on optimal point distributions in \([0,1)^{s}\)
- Can the Measure of ∪ n 1 [ a i , b i be Computed in Less Than O(n logn) Steps?]
- The measure problem for rectangular ranges in d-space
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- New Upper Bounds in Klee’s Measure Problem
- On Diversity
- A generalized discrepancy and quadrature error bound
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- Machine Learning: ECML 2004
- Minimum-weight spanning tree algorithms. A survey and empirical study
