Boosting(机器学习)
模式识别(心理学)
聚类分析
粒度
人工智能
计算机科学
k-最近邻算法
代表(政治)
编码(集合论)
源代码
数据挖掘
支持向量机
机器学习
操作系统
集合(抽象数据类型)
政治
政治学
法学
程序设计语言
作者
Jiang Xie,Xuexin Xiang,Shuyin Xia,Lian Jiang,Guoyin Wang,Xinbo Gao
标识
DOI:10.1109/tpami.2024.3400281
摘要
In the real world, data distributions often exhibit multiple granularities. However, the majority of existing neighbor-based machine-learning methods rely on manually setting a single-granularity for neighbor relationships. These methods typically handle each data point using a single-granularity approach, which severely affects their accuracy and efficiency. This paper adopts a dual-pronged approach: it constructs a multi-granularity representation of the data using the granular-ball computing model, thereby boosting the algorithm's time efficiency. It leverages the multi-granularity representation of the data to create tailored, multi-granularity neighborhood relationships for different task scenarios, resulting in improved algorithmic accuracy. The experimental results convincingly demonstrate that the proposed multi-granularity neighbor relationship effectively enhances KNN classification and clustering methods. The source code has been publicly released and is now accessible on GitHub at https://github.com/xjnine/MGNR .
科研通智能强力驱动
Strongly Powered by AbleSci AI