首页> 外文会议>Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on >Boosting algorithms for simultaneous feature extraction and selection
【24h】

Boosting algorithms for simultaneous feature extraction and selection

机译:用于同时提取和选择特征的Boosting算法

获取原文
获取原文并翻译 | 示例

摘要

The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) select existing features or 2) assemble a combination of these features. This framework is simple and mathematically sound, derived from the statistical view of boosting and Taylor series approximations in functional space. Unlike classical boosting, which is limited to linear feature combinations, the new algorithms support more sophisticated combinations of weak learners, such as “sums of products” or “products of sums”. This is shown to enable the design of fairly complex predictor structures with few weak learners in a fully automated manner, leading to faster and more accurate classifiers, based on more informative features. Extensive experiments on synthetic data, UCI datasets, object detection and scene recognition show that these predictors consistently lead to more accurate classifiers than classical boosting algorithms.
机译:考虑了用于分类器设计的同时特征提取和选择的问题。提出了一种基于增强算法的新框架,该算法可以1)选择现有特征或2)组合这些特征的组合。这个框架是简单的,并且在数学上是可靠的,它是从功能空间中的Boosting和Taylor级数逼近的统计角度得出的。与经典提升方法(仅限于线性特征组合)不同,新算法支持弱学习者的更复杂组合,例如“乘积和”或“乘积”。这显示出能够以全自动的方式设计几乎没有弱学习者的相当复杂的预测器结构,从而基于更多信息功能而导致更快,更准确的分类器。在合成数据,UCI数据集,目标检测和场景识别方面的大量实验表明,与传统的增强算法相比,这些预测变量始终可导致更准确的分类器。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号