As K-B hierarchies are large complex DAG structures, we develop a highly-efficient scheme to enable practical training.
we associate a separate distance metric M h ∈ R n×n with each category h in the hierarchy.