我开发了用于系统发育树比较的新算法(系统发育树只是有根二叉树)。作为输入,我们有两棵树,我们想要计算它们的相似度百分比。 此处就是此类算法的一个示例。
但这些算法中的大多数(据我所知)都没有提供一种好的方法来检查其算法的准确性。例如,如果您查看下图,您会发现 T1 和 T3 之间比 T1 和 T2 之间有更多相似性。

我需要一种方法来检查其相似性度量的准确性,以确保我的算法优于以前的算法!!! (在大多数情况下,人眼并不困难,但我不知道如何将其扩展到我的应用程序)
您的有效性度量应该独立于算法。
I developed new algorithm for phylogenetic tree comparison(phylogenetic tree is simply rooted binary tree). As an input we have two trees, we want to calculate their similarity percentage. one example of these type of algorithms is here.
But most of these algorithms(as I know all of them) did not offer a good way to check the accuracy of their algorithms. e.g if you look at the following figure, you can see there is more similarity between T1 and T3, versus T1 and T2.

I need a method for checking its accuracy of similarity measure, To be sure that my algorithm is better than previous algorithms !!! (it is not difficult in most of the case by human eyes but I don't know how to extend it to my application)
your validity measure should be independent from algorithm.
发布评论
评论(1)
查看“图相似度评分和匹配”和“一种比较两个层次聚类的方法”。也许它们(或链接的参考文献)会有所帮助。
Take a look at "Graph similarity scoring and matching" and "A Method for Comparing Two Hierarchical Clusterings". Maybe they (or linked references) will be helpful.