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

面向kNN图构建的分布信息自适应方法

Distribution-Informed Adaptation for kNN Graph Construction

Chongqing University(重庆大学)

Shaojie Min, Ji Liu

AI总结:

针对传统kNN图因统一k值在复杂分布数据上性能受限的问题,提出分布信息自适应kNN图(DaNNG),结合自适应k与分布感知构建,显著提升模糊样本性能,在多个基准上优于现有方法。

摘要:

基于图的kNN算法因其简单性和有效性,在机器学习任务中广受欢迎。然而,由于实际数据往往继承复杂的分布,传统kNN图对统一k值的依赖可能阻碍其性能。这一挑战背后的关键因素之一是决策边界上存在模糊样本,这些样本不可避免地更容易被错误分类。为解决这一问题,我们提出了分布信息自适应kNN图(DaNNG),它将自适应kNN与分布感知的图构建相结合。通过结合分布的近似与定制的k自适应准则,DaNNG能够显著提升对模糊样本的性能,从而增强整体准确率和泛化能力。通过对多个基准数据集的严格评估,DaNNG优于最先进的算法,展示了其在各种现实场景中的适应性和有效性。

英文摘要:

Graph-based kNN algorithms have garnered widespread popularity for machine learning tasks due to their simplicity and effectiveness. However, as factual data often inherit complex distributions, the conventional kNN graph's reliance on a unified k-value can hinder its performance. A crucial factor behind this challenge is the presence of ambiguous samples along decision boundaries that are inevitably more prone to incorrect classifications. To address the situation, we propose the Distribution-Informed adaptive kNN Graph (DaNNG), which combines adaptive kNN with distribution-aware graph construction. By incorporating an approximation of the distribution with customized k-adaption criteria, DaNNG can significantly improve performance on ambiguous samples, and hence enhance overall accuracy and generalization capability. Through rigorous evaluations on diverse benchmark datasets, DaNNG outperforms state-of-the-art algorithms, showcasing its adaptability and efficacy across various real-world scenarios.

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

↑