1 Hit in 2.7 sec

LdSM: Logarithm-depth Streaming Multi-label Decision Trees [article]

Maryam Majzoubi, Anna Choromanska
<span title="2020-06-10">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Efficient annotation can be achieved with balanced tree predictors, i.e. trees with logarithmic-depth in the label complexity, whose leaves correspond to labels.  ...  In this paper we develop the LdSM algorithm for the construction and training of multi-label decision trees, where in every node of the tree we optimize a novel objective function that favors balanced  ...  Logarithm-depth Streaming Multi-label Decision Trees (Supplementary material) Abstract This Supplement presents additional details in support of the full article.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:1905.10428v5</a> <a target="_blank" rel="external noopener" href="">fatcat:vnuub646tvbp7jpxgqr7divh3u</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>