首页> 外文会议>Structural, Syntactic, and Statistical Pattern Recognition >Decision Tree Using Class-Dependent Feature Subsets
【24h】

Decision Tree Using Class-Dependent Feature Subsets

机译:使用类相关特征子集的决策树

获取原文

摘要

In pattern recognition, feature selection is an important technique for reducing the measurement cost of features or for improving the performance of classifiers, or both. Removal of features with no discriminative information is effective for improving the precision of estimated parameters of parametric classifiers. Many feature selection algorithms choose a feature subset that is useful for all classes in common. However, the best feature subset for separating one group of classes from another may depend on groups. In this study, we investigate the effectiveness of choosing feature subsets depending on groups of classes (class-dependent features), and propose a classifier system that is built as a decision tree in which nodes have class-dependent feature subsets.
机译:在模式识别中,特征选择是降低功能的测量成本或提高分类器的性能的重要技术,或者两者。除去没有判别信息的特征对于提高参数分类器的估计参数的精度是有效的。许多特征选择算法选择一个有用的特征子集,这对于所有类共同。然而,用于将一组类从另一组分离的最佳特征子集可能取决于组。在这项研究中,我们调查根据类别(依赖类别)组选择特征子集的有效性,并提出了一个分类器系统,该分类器系统构建为决策树,其中节点具有依赖类特征子集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号