Unverified50% confidenceFactExact time
PEEL recovers the complete taxonomy DAG on a directed graph via a minimum spanning arborescence algorithm, without presupposing a fixed depth or number of branches.
1
Sources
50%
Confidence
Long-term
Relevance
11/2/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedBonsai算法将传统决策树与稀疏投影结合，通过随机投影将高维特征映射至低维空间，再构建节点数15-31个的浅层树66% similarUnverified梯度提升树对特征尺度不敏感、能自动捕捉非线性关系与特征交互、在有限样本下泛化能力强65% similarUnverifiedOctrees can represent geometric information of equivalent precision to a uniform voxel grid with exponentially fewer nodes, because they only partition densely near shape boundaries.65% similarUnverifiedThe principle of tiled processing is to split the feature map into sub-tiles along the spatial dimension for independent computation and then merge them; peak VRAM usage decreases linearly as the number of tiles increases, but overlapping sampling is required to avoid seams and the total computation increases slightly.63% similarUnverifieddagre 本质上是一个分层有向图布局算法，将节点分配到不同层级后在层内进行排序以减少交叉63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1124947API
curl https://kongchang.com/api/v1/knowledge/claims/1124947MCP
get_claim(id=1124947)