© 1999-2048 dssz.net 粤ICP备11031372号
[机器学习] Dense_Neighborhoods_on_Affinity_Graph.pdf
说明: 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 construct<qq_33879672> 上传 | 大小:704kb