首页> 外文会议>IEEE Conference on Computer Vision and Pattern Recognition >Semi-supervised Node Splitting for Random Forest Construction
【24h】

Semi-supervised Node Splitting for Random Forest Construction

机译:半监督节点分裂用于随机森林建设

获取原文

摘要

Node splitting is an important issue in Random Forest but robust splitting requires a large number of training samples. Existing solutions fail to properly partition the feature space if there are insufficient training data. In this paper, we present semi-supervised splitting to overcome this limitation by splitting nodes with the guidance of both labeled and unlabeled data. In particular, we derive a nonparametric algorithm to obtain an accurate quality measure of splitting by incorporating abundant unlabeled data. To avoid the curse of dimensionality, we project the data points from the original high-dimensional feature space onto a low-dimensional subspace before estimation. A unified optimization framework is proposed to select a coupled pair of subspace and separating hyper plane such that the smoothness of the subspace and the quality of the splitting are guaranteed simultaneously. The proposed algorithm is compared with state-of-the-art supervised and semi-supervised algorithms for typical computer vision applications such as object categorization and image segmentation. Experimental results on publicly available datasets demonstrate the superiority of our method.
机译:节点拆分是随机森林中的一个重要问题,但是强大的拆分需要大量的训练样本。如果训练数据不足,现有解决方案将无法正确划分特征空间。在本文中,我们提出了半监督分割,以通过在标记和未标记数据的指导下分割节点来克服此限制。特别是,我们推导了一种非参数算法,可以通过合并大量未标记的数据来获得精确的分割质量度量。为了避免维数的诅咒,我们在估计之前将数据点从原始的高维特征空间投影到低维子空间上。提出了一个统一的优化框架,以选择一对耦合的子空间并分离超平面,从而可以同时保证子空间的平滑性和分割质量。将该算法与用于典型计算机视觉应用(例如对象分类和图像分割)的最新监督和半监督算法进行了比较。在公开数据集上的实验结果证明了我们方法的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号