【24h】

Geometrical Probability Covering Algorithm

机译:几何概率覆盖算法

获取原文

摘要

In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of geometrical properties of data, the proposed algorithm first forms extended prototypes through computing means of any two prototypes in the same class. Then Gaussian kernel is employed for covering the geometrical structure of data and used as a local probability measurement. By computing the sum of the probabilities that a new sample to be classified to the set of prototypes and extended prototypes, the classified criterion based on the global probability measurement is achieved. The proposed GPC algorithm is simple but powerful, especially, when training samples are sparse and small size. Experiments on several databases show that the proposed algorithm is promising. Also, we explore other potential applications such as outlier removal with the proposed GPC algorithm.
机译:在本文中,我们提出了一种新颖的分类算法,称为几何概率覆盖(GPC)算法,提高分类能力。在数据的几何特性的基础上,所提出的算法首先通过同一类中的任何两个原型的计算装置形成扩展原型。然后采用高斯内核用于覆盖数据的几何结构并用作局部概率测量。通过计算将新样本分类为模拟的概率和扩展原型的概率之和,实现了基于全局概率测量的分类标准。所提出的GPC算法简单但功能强大,特别是当训练样本稀疏和小尺寸时。关于若干数据库的实验表明,所提出的算法很有前景。此外,我们探讨了其他潜在的应用,例如使用所提出的GPC算法删除异常值。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号