...
首页> 外文期刊>Pattern Recognition: The Journal of the Pattern Recognition Society >A novel random forests based class incremental learning method for activity recognition
【24h】

A novel random forests based class incremental learning method for activity recognition

机译:基于新的随机林的活动识别级增量学习方法

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

摘要

Automatic activity recognition is an active research topic which aims to identify human activities automatically. A significant challenge is to recognize new activities effectively. In this paper, we propose an effective class incremental learning method, named Class Incremental Random Forests (CIRF), to enable existing activity recognition models to identify new activities. We design a separating axis theorem based splitting strategy to insert internal nodes and adopt Gini index or information gain to split leaves of the decision tree in the random forests (RF). With these two strategies, both inserting new nodes and splitting leaves are allowed in the incremental learning phase. We evaluate our method on three UCI public activity datasets and compare with other state-of-the-art methods. Experimental results show that the proposed incremental learning method converges to the performance of batch learning methods (RF and extremely randomized trees). Compared with other state-of-the-art methods, it is able to recognize new class data continuously with a better performance. (C) 2018 Elsevier Ltd. All rights reserved.
机译:自动活动识别是一个积极的研究主题,旨在自动识别人类活动。一项重大挑战是有效地识别新活动。在本文中,我们提出了一种有效的类增量学习方法,名为Class增量随机林(CIRF),以使现有的活动识别模型能够识别新活动。我们设计了基于分离的轴定理的分离策略,以插入内部节点,并采用Gini索引或信息增益来分割随机林(RF)中决策树的叶子。在增量学习阶段允许插入新节点和分裂叶的这两种策略。我们在三个UCI公共活动数据集中评估我们的方法,并与其他最先进的方法进行比较。实验结果表明,所提出的增量学习方法会聚到批量学习方法(RF和极其随机树木)的性能。与其他最先进的方法相比,能够以更好的性能持续识别新的类数据。 (c)2018年elestvier有限公司保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号