文件名称：Dense_Neighborhoods_on_Affinity_Graph.pdf
文件大小：704KB
文件格式：PDF
更新时间：2022-06-20 04:10:17
affinity Graph
In this paper, we study the problem of how to reliably compute neighborhoods on affinity graphs. The k- nearest neighbors (kNN) is one of the most fundamental and simple methods widely used in many tasks, such as classi- fication and graph construction.