Construct · 1 fields · 1 citations

probabilistic tree embedding: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph algorithms

approximating any metric by a random tree metric whose expected distortion is logarithmic in the number of points.

In graph algorithms, probabilistic tree embedding refers to approximating any metric by a random tree metric whose expected distortion is logarithmic in the number of points. This meaning comes from Fakcharoenphol (2004) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how probabilistic tree embedding sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

distortion4 fields · 7 citationsjingle · one word, four constructs embedding2 fields · 3 citationsjingle · one word, two constructs metric4 fields · 4 citationsjingle · one word, four constructs

References

Fakcharoenphol, J., Rao, S., & Talwar, K. (2004). A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences, 69(3), 485-497. https://doi.org/10.1016/j.jcss.2004.04.011

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct