首页>
外国专利>
Evaluating feature vectors across disjoint subsets of decision trees
Evaluating feature vectors across disjoint subsets of decision trees
展开▼
机译:跨决策树的不相交子集评估特征向量
展开▼
页面导航
摘要
著录项
相似文献
摘要
The disclosure is directed to evaluating feature vectors using decision trees. Typically, the number of feature vectors and the number of decision trees are very high, which prevents loading them into a processor cache. The feature vectors are evaluated by processing the feature vectors across a disjoint subset of trees repeatedly. After loading the feature vectors into the cache, they are evaluated across a first subset of trees, then across a second subset of trees and so on. If the values based on the first and second subsets satisfy a specified criterion, further evaluation of the feature vectors across the remaining of the decision trees is terminated, thereby minimizing the number of trees evaluated and therefore, consumption of computing resources.
展开▼