Transforming Hierarchical Trees on Metric Spaces
نویسندگان
چکیده
We show how a simple hierarchical tree called a cover tree can be turned into an asymptotically more efficient one known as a net-tree in linear time. We also introduce two linear-time operations to manipulate cover trees called coarsening and refining. These operations make a trade-off between tree height and the node degree.
منابع مشابه
Improved Error Bounds for Tree Representations of Metric Spaces
Estimating optimal phylogenetic trees or hierarchical clustering trees from metric data is an important problem in evolutionary biology and data analysis. Intuitively, the goodness-of-fit of a metric space to a tree depends on its inherent treeness, as well as other metric properties such as intrinsic dimension. Existing algorithms for embedding metric spaces into tree metrics provide distortio...
متن کاملMetric Representations of Network Data
Networks are structures that encode relationships between pairs of elements or nodes. However, there is no imposed connection between these relationships, i.e., the relationship between two nodes can be independent of every other one in the network, and need not be defined for every possible pair of nodes. This is not true for metric spaces, where the triangle inequality imposes conditions that...
متن کاملExtended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملPolylogarithmic Competitive Ratios for the Randomized Online k-server Problem
In this paper, we will study recent work on and progress towards polylogarithmic competitive ratios for the k-server problem. For a long time, the best known competitive ratio that held for general metric spaces was 2k − 1, shown by Koutsoupias and Papadimitriou [3] in 1995. A paper by Coté et al. [7] in 2008 gave a randomized algorithm with a O(log ∆) competitive ratio for k-server on binary t...
متن کامل$C$-class and $F(psi,varphi)$-contractions on $M$-metric spaces
Partial metric spaces were introduced by Matthews in 1994 as a part of the study of denotational semantics of data flow networks. In 2014 Asadi and {it et al.} [New Extension of $p$-Metric Spaces with Some fixed point Results on $M$-metric paces, J. Ineq. Appl. 2014 (2014): 18] extend the Partial metric spaces to $M$-metric spaces. In this work, we introduce the class of $F(psi,varphi)$-contrac...
متن کامل