Minimum Spanning Arborescence
An algorithm that finds, on a directed graph, a tree structure covering all nodes with minimum total weight. It is commonly used to recover hierarchical structure from graph data.
Timeline (last 90 days)
PEEL is a lightweight probing method that operates on frozen embeddings, decoding a classification DAG from a concept vocabulary via an order-embedding objective and a minimum spanning arborescence algorithm.
PEEL recovers the complete taxonomy DAG on a directed graph via a minimum spanning arborescence algorithm, without presupposing a fixed depth or number of branches.
All Facts (2)
PEEL is a lightweight probing method that operates on frozen embeddings, decoding a classification DAG from a concept vocabulary via an order-embedding objective and a minimum spanning arborescence algorithm.
50%UnverifiedPEEL recovers the complete taxonomy DAG on a directed graph via a minimum spanning arborescence algorithm, without presupposing a fixed depth or number of branches.
50%