A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1905.10428v5.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Filters
LdSM: Logarithm-depth Streaming Multi-label Decision Trees
[article]
<span title="2020-06-10">2020</span>
<i >
arXiv
</i>
<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="https://arxiv.org/abs/1905.10428v5">arXiv:1905.10428v5</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vnuub646tvbp7jpxgqr7divh3u">fatcat:vnuub646tvbp7jpxgqr7divh3u</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200623200759/https://arxiv.org/pdf/1905.10428v5.pdf" 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="https://arxiv.org/abs/1905.10428v5" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>