On Population Diversity Measures in Euclidean Space

被引:0
|
作者
Lacevic, Bakir [1 ]
Amaldi, Edoardo [1 ]
机构
[1] Politecn Milan, Dipartimento Elettron & Informaz, I-20133 Milan, Italy
来源
2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2010年
关键词
CLASSIFIER ENSEMBLES; ALGORITHMS; BOUNDS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper we define a mathematical notion of ectropy for classifying diversity measures in terms of the extent to which they tend to penalize point collocation, we investigate the advantages and disadvantages of several known measures and we propose some novel ones. In particular, we introduce a measure based on Euclidean minimum spanning trees, a class of power mean based measures and three measures based on discrepancy from uniform distribution. All considered measures are tested and compared on a large set of random and structured populations. Special attention is also devoted to the complexity of computing the measures. The measure based on Euclidean minimum spanning trees turns out to be the most promising one in terms of the tradeoff between the computational complexity and the ectropic behavior.
引用
收藏
页数:8
相关论文
共 50 条