Fast-HyperDT reexpresses HyperDT as pre- and post-processing around standard Euclidean trees, making hyperbolic random forests practical.
Gaussian Beltrami - Klein Model for Protein Sequence Classification : A Hyperbolic Approach
1 Pith paper cite this work, alongside 3 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3
external citations · OpenAlex
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach
Fast-HyperDT reexpresses HyperDT as pre- and post-processing around standard Euclidean trees, making hyperbolic random forests practical.