arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2201.04343cs.LG
收藏

一种高效自适应的分类问题粒球生成方法

An Efficient and Adaptive Granular-ball Generation Method in Classification Problem

Chongqing University of Telecommunications and Posts(重庆邮电大学);University of California Riverside(加州大学河滨分校)

Shuyin Xia, Xiaochuan Dai, Guoyin Wang, Xinbo Gao, Elisabeth Giem

摘要:

粒球计算是一种高效、鲁棒、可扩展的粒计算学习方法。颗粒球计算的基础是颗粒球生成方法。本文提出了一种用除法代替$k$ -means的方法来加速粒子球的生成。该方法在保证与现有方法相似的精度的同时,大大提高了颗粒球生成的效率。此外,考虑到颗粒球的重叠消除等因素,提出了一种新的自适应颗粒球生成方法。这使得颗粒球生成过程成为真正意义上的无参数完全自适应过程。此外,本文首次给出了颗粒球覆盖的数学模型。在真实数据集上的实验结果表明,提出的两种粒子球生成方法在实现自适应或加速的同时,具有与现有方法相当的精度.

英文摘要:

Granular-ball computing is an efficient, robust, and scalable learning method for granular computing. The basis of granular-ball computing is the granular-ball generation method. This paper proposes a method for accelerating the granular-ball generation using the division to replace $k$-means. It can greatly improve the efficiency of granular-ball generation while ensuring the accuracy similar to the existing method. Besides, a new adaptive method for the granular-ball generation is proposed by considering granular-ball's overlap eliminating and some other factors. This makes the granular-ball generation process of parameter-free and completely adaptive in the true sense. In addition, this paper first provides the mathematical models for the granular-ball covering. The experimental results on some real data sets demonstrate that the proposed two granular-ball generation methods have similar accuracies with the existing method while adaptiveness or acceleration is realized.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑