ESTIMATING CHARACTER WEIGHTS DURING TREE-SEARCH
ESTIMATING CHARACTER WEIGHTS DURING TREE-SEARCH
复制标题
DOI：
10.1111/j.1096-0031.1993.tb00209.x
复制
发表时间：
1993-03-01
期刊：
影响因子：
--
通讯作者：
GOLOBOFF, PA
中科院分区：
文献类型：
--
作者：
GOLOBOFF, PA
提出了一种根据字符的同质性对字符进行加权的新方法；该方法是非迭代的，不需要独立的权重估计。它基于搜索具有最大总拟合的树，将特征拟合定义为同质性的凹函数。然后，当比较树木时，在树上表现出更多同质性的性状发生的步长差异影响较小。在分析过程中，作为所比较的树的逻辑含义，估计字符的可靠性。“最适合”的树意味着字符是最可靠的，并且在字符冲突的情况下，更适合树的字符的步骤更少。如果其他树在某些字符上节省了步骤，那么它将以在同质性较差的字符上获得这些步骤为代价。
A new method for weighting characters according to their homoplasy is proposed; the method is non‐iterative and does not require independent estimations of weights. It is based on searching trees with maximum total fit, with character fits defined as a concave function of homoplasy. Then, when comparing trees, differences in steps occurring in characters which show more homoplasy on the trees are less influential. The reliability of the characters is estimated, during the analysis, as a logical implication of the trees being compared. The “fittest” trees imply that the characters are maximally reliable and, given character conflict, have fewer steps for the characters which fit the tree better. If other trees save steps in some characters, it will be at the expense of gaining them in characters with less homoplasy.