带算术平均数的非加权多组法

Li Yujian, Xu Liye
{"title":"带算术平均数的非加权多组法","authors":"Li Yujian, Xu Liye","doi":"10.1109/BICTA.2010.5645232","DOIUrl":null,"url":null,"abstract":"The traditional UPGMA (Unweighted Pair Group Method with Arithmetic Mean) sometimes derives two or more topologies of “tie trees” from a single data set, depending on the order of data entry. This paper presents an improved algorithm for UPGMA, namely, UMGMA (Unweighted Multiple Group Method with Arithmetic Mean), which can produce a unique multifurcating tree from any distance matrix. Moreover, a UMGMA tree has the same topology as its corresponding UPGMA tree if it is actually bifurcating. UMGMA is different from UPGMA in that it repeatedly merges multiple groups into one by the vertices of a maximal θ-distant subtree until only one group is left, so the UMGMA tree is always unique even in the case that the UPGMA tree is not unique.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Unweighted Multiple Group Method with Arithmetic Mean\",\"authors\":\"Li Yujian, Xu Liye\",\"doi\":\"10.1109/BICTA.2010.5645232\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The traditional UPGMA (Unweighted Pair Group Method with Arithmetic Mean) sometimes derives two or more topologies of “tie trees” from a single data set, depending on the order of data entry. This paper presents an improved algorithm for UPGMA, namely, UMGMA (Unweighted Multiple Group Method with Arithmetic Mean), which can produce a unique multifurcating tree from any distance matrix. Moreover, a UMGMA tree has the same topology as its corresponding UPGMA tree if it is actually bifurcating. UMGMA is different from UPGMA in that it repeatedly merges multiple groups into one by the vertices of a maximal θ-distant subtree until only one group is left, so the UMGMA tree is always unique even in the case that the UPGMA tree is not unique.\",\"PeriodicalId\":302619,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2010.5645232\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

传统的UPGMA (Unweighted Pair Group Method with Arithmetic Mean)有时会根据数据输入的顺序,从单个数据集衍生出两个或多个“纽带树”拓扑。本文提出了一种改进的UPGMA算法,即UMGMA (Unweighted Multiple Group Method with Arithmetic Mean),它可以从任意距离矩阵生成唯一的多分树。此外,如果UMGMA树实际上是分岔的,那么它与其对应的UPGMA树具有相同的拓扑结构。UMGMA与UPGMA的不同之处在于,它通过最大θ-距离子树的顶点反复将多个组合并为一个,直到只剩下一个组,因此即使在UPGMA树不唯一的情况下,UMGMA树也始终是唯一的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Unweighted Multiple Group Method with Arithmetic Mean
The traditional UPGMA (Unweighted Pair Group Method with Arithmetic Mean) sometimes derives two or more topologies of “tie trees” from a single data set, depending on the order of data entry. This paper presents an improved algorithm for UPGMA, namely, UMGMA (Unweighted Multiple Group Method with Arithmetic Mean), which can produce a unique multifurcating tree from any distance matrix. Moreover, a UMGMA tree has the same topology as its corresponding UPGMA tree if it is actually bifurcating. UMGMA is different from UPGMA in that it repeatedly merges multiple groups into one by the vertices of a maximal θ-distant subtree until only one group is left, so the UMGMA tree is always unique even in the case that the UPGMA tree is not unique.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信