首页 | 本学科首页   官方微博 | 高级检索  
     


The median procedure for n-trees
Authors:Jean-Pierre Barthélemy  F. R. McMorris
Affiliation:(1) Ecole Nationale Supérieure des Télécommunications, 46 rue Barrault, 75634 Paris, Cedex 13, France;(2) Division of Mathematical Sciences, Office of Naval Research, 22217-5000 Arlington, VA, USA
Abstract:Let (X,d) be a metric space The functionM:Xk rarr 2x defined by
$$M(x_1 ,,x_k ) = { x in X:sumlimits_{i = 1}^k {d(x,x_i )}$$
is the minimum } is called themedian procedure and has been found useful in various applications involving the notion of consensus Here we present axioms that characterizeM whenX is a certain class of trees (hierarchical classifications), andd is the symmetric difference metricWe would like to thank the referees and Editor for helpful comments
Keywords:n-Trees  Consensus  Median procedure  Majority rule
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号