首页> 外文期刊>Pattern Analysis and Applications >An efficient algorithm for large-scale quasi-supervised learning
【24h】

An efficient algorithm for large-scale quasi-supervised learning

机译:一种有效的大规模准监督学习算法

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

摘要

We present a novel formulation for quasi-supervised learning that extends the learning paradigm to large datasets. Quasi-supervised learning computes the posterior probabilities of overlapping datasets at each sample and labels those that are highly specific to their respective datasets. The proposed formulation partitions the data into sample groups to compute the dataset posterior probabilities in a smaller computational complexity. In experiments on synthetic as well as real datasets, the proposed algorithm attained significant reduction in the computation time for similar recognition performances compared to the original algorithm, effectively generalizing the quasi-supervised learning paradigm to applications characterized by very large datasets.
机译:我们提出了一种用于准监督学习的新方法,该方法将学习范式扩展到大型数据集。准监督学习计算每个样本处重叠数据集的后验概率,并标记那些高度针对其各自数据集的后验概率。提出的公式将数据划分为样本组,以较小的计算复杂度来计算数据集的后验概率。在原始数据集和真实数据集上的实验中,与原始算法相比,该算法在相似识别性能方面的计算时间显着减少,从而将准监督学习范式有效地推广到了以大型数据集为特征的应用程序。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号