论文标题
算术二进制决策树遍历
Arithmetical Binary Decision Tree Traversals
论文作者
论文摘要
本文介绍了一系列使用算术操作遍历二进制决策树的方法。我们提出了一套二进制树遍历算法的套件，该算法利用新颖的表示矩阵将完整的二进制树结构弄平，并将聚合的内部节点布尔测试嵌入到单个二元矢量中。我们的方法以最大的内部产品搜索为基础，为决策树提供了新的见解。
This paper introduces a series of methods for traversing binary decision trees using arithmetic operations. We present a suite of binary tree traversal algorithms that leverage novel representation matrices to flatten the full binary tree structure and embed the aggregated internal node Boolean tests into a single binary vector. Our approach, grounded in maximum inner product search, offers new insights into decision tree.
