A synopsis of comparative metrics for classifications
April 11, 2018 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Bernardo Lopo Tavares
arXiv ID
1804.03929
Category
cs.DS: Data Structures & Algorithms
Cross-listed
q-bio.QM
Citations
2
Venue
arXiv.org
Last Checked
4 months ago
Abstract
Phylogeny is the study of the relations between biological entities. From it, the need to compare tree-like graphs has risen and several metrics were established and researched, but since there is no definitive way to compare them, its discussion is still open nowadays. All of them emphasize different features of the structures and, of course, the efficiency of these computations also varies. The work in this article is mainly expositive (a lifting from a collection of papers and articles) with special care in its presentation (trying to mathematically formalize what was not presented that way previously) and filling (with original work) where information was not available (or at least, to our knowledge) given the frame we set to fit these metrics, which was to state their discriminative power and time complexity. The Robinson Foulds, Robinson Foulds Length, Quartet, Triplet, Triplet Length, Geodesic metrics are approached with greater detail (stating also some of its problems in formulation and discussing its intricacies) but the reader can also expect that less used (but not necessarily less important or less promising) metrics will be covered, which are Maximum Aggreement Subtree, Align, Cophenetic Correlation Coeficcient, Node, Similarity Based on Probability, Hybridization Number and Subtree Prune and Regraft. Finally, some challenges that sprouted from making this synopsys are presented as a possible subject of study and research.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted