首页> 外文会议>SIAM International Conference on Data Mining >Incremental Multi-view Support Vector Machine
【24h】

Incremental Multi-view Support Vector Machine

机译:增量多视图支持向量机

获取原文

摘要

Multi-view classification has received considerable attention in recent years. We observed that the existing multi-view classification methods learn a consensus result by collecting all views and thus have two critical limitations. First, it is not scalable. Second, in many applications views of data are available over time; it is infeasible to apply the existing multi-view learning methods to such streaming views. To address the two limitations, in this paper we propose a novel incremental multi-view SVM method, i.e., instead of processing all views simultaneously, we integrate them one by one in an incremental way. We first learn an initial model from the first view; next when a new view is available, we update the model and then apply it to learn a new consensus result. This incremental method is scalable and applicable to streaming views. We present a block coordinate descent algorithm whose convergence is theoretically guaranteed to optimize the induced objective function. Experimental results on several benchmark data sets further demonstrate the effectiveness of our method.
机译:多视图分类近年来受到了相当大的关注。我们观察到,现有的多视图分类方法通过收集所有视图来学习共识结果,从而具有两个关键限制。首先,它不是可扩展的。其次,在许多应用中,数据的视图随着时间的推移是可获得的;将现有的多视图学习方法应用于此类流视图是不可行的。为了解决两个限制,本文提出了一种新颖的增量多视图SVM方法,即,而不是同时处理所有视图,我们以增量方式将它们一对一集成。我们首先从第一个视图中学习初始模型;接下来,当新视图可用时,我们更新模型,然后应用它以学习新的共识结果。此增量方法可扩展,适用于流视图。我们介绍了一个块坐标阶级算法,其会聚理论上是保证优化诱导的目标函数。若干基准数据集的实验结果进一步证明了我们方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号